# Quickhull

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 of quicksort, from which its name derives. Its worst case time complexity for 2-dimensional and 3-dimensional space is $O(n^{2})$, but when the input precision is restricted to $O(\log n)$ bits, its worst case time complexity is conjectured to be $O(n\log r)$, where $n$ is the number of input points and $r$ is the number of processed points (up to $n$).
N-dimensional Quickhull was invented in 1996 by C. Bradford Barber, David P. Dobkin, and Hannu Huhdanpaa. It was an extension of Jonathan Scott Greenfield's 1990 planar Quickhull algorithm, although the 1996 authors did not know of his methods. Instead, Barber et al. describe it as a deterministic variant of Clarkson and Shor's 1989 algorithm.

## Algorithm

The 2-dimensional algorithm can be broken down into the following steps:
* Find the points with minimum and maximum x coordinates, as these will always be part of the convex hull. If many points with the same minimum/maximum x exist, use the ones with the minimum/maximum y, respectively.
* Use the line formed by the two points to divide the set into two subsets of points, which will be processed recursively. We next describe how to determine the part of the hull above the line; the part of the hull below the line can be determined similarly.
* Determine the point above the line with the maximum distance from the line. This point forms a triangle with the two points on the line.
* The points lying inside of that triangle cannot be part of the convex hull and can therefore be ignored in the next steps.
* Recursively repeat the previous two steps on the two lines formed by the two new sides of the triangle.
* Continue until no more points are left, the recursion has come to an end and the points selected constitute the convex hull.
The problem is more complex in the higher-dimensional case, as the hull is built from many facets; the data structure needs to account for that and record the line/plane/hyperplane (ridge) shared by neighboring facets too. For d dimensions:
* Pick d + 1 points from the set that do not share a plane or a hyperplane. This forms an initial hull with facets Fs.
* For each F in Fs, find all unassigned points that are "above" it; i.e., pointing away from the center of the hull, and assign them to an "outside" set F.O associated with F. The algorithm maintains the invariant that every point that has not been added to the hull but could potentially be a vertex of it is assigned to exactly one outside set.
* For each F with a non-empty F.O:
** Find the point p in F.O with the maximum distance from F and add it to the hull. Note that p will not necessarily be a vertex of the final hull, as it might be removed later.
** Create a visible set V and initialize it to F. Extend V in all directions for neighboring facets Fv until no further facets are visible from p. Fv being visible from p means that p is above Fv.
** The boundary of V then forms the set of horizon ridges H.
** Let Fnew be the set of facets created from p and all ridges in H.
** Unassign all points in the outside sets of facets in V. For each new facet in Fnew, perform step (2) only considering these newly unassigned points to initialize its outside set. Note that every point that remains unassigned at the end of this process lies within the current hull.
** Delete the now-internal facets in V from Fs. Add the new facets in Fnew to Fs and continue the iteration.

## Pseudocode for 2D set of points

A pseudocode specialized for the 3D case is available from Jordan Smith. It includes a similar "maximum point" strategy for choosing the starting hull. If these maximum points are degenerate, the whole point cloud is as well.