The convex hull of a set of points S is the intersection of all convex sets containing S.

The convex hull of a set of points S in n dimensions is the intersection of all convex sets containing S. For N points p_1, ..., p_N, the convex hull C is then given by the expression C congruent { sum_(j = 1)^N λ_j p_j :λ_j>=0 for all j and sum_(j = 1)^N λ_j = 1}.

Carathéodory's fundamental theorem | computational geometry | cross polytope | Delaunay triangulation | expansion | geometric span | Groemer packing | Groemer theorem | happy end problem | Radon's theorem | sausage conjecture | Sylvester's four-point problem | temperature | Voronoi diagram

high school level