Convex hull

From DmWiki

Having a set of points, either in 2D or 3D space (or N-space, for that matter), the convex hull is the smallest polygon (2D) or polyhedron (3D), containing all of the aforementioned points.

Calculating the convex hull is in the most cases a very complex and computationally expensive task. There are numerous algorithms and suggestions how to calculate the convex hull of a set of points in N dimensions. For more information on them, refer to the Computer Graphics FAQ (http://www.faqs.org/faqs/graphics/algorithms-faq/).