Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science.

Graham scan · Gift wrapping algorithm · Quickhull · Chan's algorithm

The convex hull may be defined either as the intersection of all convex sets containing a given subset of a Euclidean space, or equivalently as the set of all ...

Topological properties · Computation · Applications

The main article for this category is Convex hull algorithms. Pages in category "Convex hull algorithms". The following 11 pages are in this category, out of 11 ...

It is a special case of the more general concept of a convex hull. It can be computed in linear time, faster than algorithms for convex hulls of point sets. The ...

Learn more about this page. This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: ...

In computational geometry, Chan's algorithm, named after Timothy M. Chan, is an optimal output-sensitive algorithm to compute the convex hull of a set P ...

The main article for this category is Convex hull. Subcategories. This category has the following 2 subcategories, out of 2 total. C. Convex hull algorithms‎ ( ...

Quickhull is a method of computing the convex hull of a finite set of points in n-dimensional space. It uses a divide and conquer approach similar to that ...