Convex Hull Algorithms

Convex Hull Algorithms

Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science, see "Convex hull applications".

In computational geometry, numerous algorithms are proposed for computing the convex hull of a finite set of points, with various computational complexities.

Computing the convex hull means that a non-ambiguous and efficient representation of the required convex shape is constructed. The complexity of the corresponding algorithms is usually estimated in terms of n, the number of input points, and h, the number of points on the convex hull.

Read more about Convex Hull Algorithms:  Planar Case, Higher Dimensions