convex hull
Noun
Meaning
convex hull (plural convex hulls)
(mathematics) The smallest convex set of points in which a given set of points is contained.
Synonyms
Examples
Expansion or cantellation involves moving each face away from the center (by the same distance so as to preserve the symmetry of the Platonic solid) and taking the convex hull.
Elements The convex hull of any nonempty subset of the n+1 points that define an n-simplex is called a face of the simplex.
Geometric freedom The pyritohedron has a geometric degree of freedom with limiting cases of a cubic convex hull at one limit of colinear edges, and a rhombic dodecahedron as the other limit as 6 edges are degenerated to length zero.
Conversely, if we can prove that a linear programming relaxation is integral, then it is the desired description of the convex hull of feasible (integral) solutions.
Computation of convex hulls main In computational geometry, a number of algorithms are known for computing the convex hull for a finite set of points and for other geometric objects.
Computing the convex hull means constructing an unambiguous, efficient representation of the required convex shape.