TOPICS
Search

Search Results for ""


371 - 380 of 486 for Convex HullSearch Results
p is an equireciprocal point if, for every chord [x,y] of a curve C, p satisfies |x-p|^(-1)+|y-p|^(-1)=c for some constant c. The foci of an ellipse are equichordal points.
The (signed) area of a planar non-self-intersecting polygon with vertices (x_1,y_1), ..., (x_n,y_n) is A=1/2(|x_1 x_2; y_1 y_2|+|x_2 x_3; y_2 y_3|+...+|x_n x_1; y_n y_1|), ...
A plane shape constructed by Reinhardt (1934) that is conjectured to be the "worst" packer of all centrally-symmetric plane regions. It has a packing density of ...
The adjective "affine" indicates everything that is related to the geometry of affine spaces. A coordinate system for the n-dimensional affine space R^n is determined by any ...
An affine transformation is any transformation that preserves collinearity (i.e., all points lying on a line initially still lie on a line after transformation) and ratios of ...
There are four fully supported stellations of the rhombic dodecahedron including as usual the original solid in the count (Wells 1991; Webb). The three nontrivial ones ...
The Banach-Saks theorem is a result in functional analysis which proves the existence of a "nicely-convergent" subsequence for any sequence {f_n}={f_n}_(n in Z^*) of ...
The simplex method is a method for solving problems in linear programming. This method, invented by George Dantzig in 1947, tests adjacent vertices of the feasible set (which ...
A set X is called a "cone" with vertex at the origin if for any x in X and any scalar a>=0, ax in X.
An n×n square matrix M with M_(ii) = 1 (1) M_(ij) = M_(ji)>1 (2) for all i,j=1, ..., n.
1 ... 35|36|37|38|39|40|41 ... 49 Previous Next

...