The convex hull of a subset S of n-dimensional space is the smallest convex set containing S. The convex hull of 3 not collinear points is a triangle, of 4 not coplanar points is a tetrahedron. (Seesimplex).
Statistics
The convex hull of a set of points in ℝn is the smallest convex polyhedron (polygon when n=2) that contains all the points.
Convex hull. The hull is defined by the positions of the extreme points. In two dimensions the hull is a convex polygon.
Computer
The smallest convex set that contains a given set. A set is convex if for any two points in the set, the points on the straight line segment joining the two points are also contained in the set.