The convex hull of a set of points is the intersection of all convex sets which contain the points.

The convex hull CH() of a polygon is the smallest convex polygon that contains .

a convenient way to get an approximation of a complex geometry object

The smallest convex region enclosing a specified group of points. In two dimensions, the convex hull is found conceptually by stretching a rubber band around the points so that all of the points lie within the band.

A simple convex polygon that completely encloses the associated geometry object.

For a set of points , the intersection of all convex sets containing .

In mathematics, the convex hull or convex envelope for a set of points X in a real vector space V is the minimal convex set containing X. (Note that X may be the union of any set of objects made of points).