Convex Hull Algorithms

Algorithms that find the smallest convex shape enclosing a set of points, such as Quickhull, Chan's algorithm and the Kirkpatrick-Seidel algorithm. An algorithm belongs here when its cited article says it computes a convex hull. It excludes triangulation and Voronoi algorithms. A member is placed here by what its own cited article states about it, not by the name of the algorithm or by the uses it is put to today, so each entry sits in the group its source describes it as belonging to.