Quickhull Algorithm

instead, Barber et al describes it as a deterministic variant of Clarkson and Shor's 1989 algorithm. N-dimensional Quickhull was invented in 1996 by C. Bradford Barber, David P. Dobkin, and Hannu Huhdanpaa.

Quickhull source code, pseudocode and analysis

This time look only from points that are outside of a aspect in V use their outside setsKeep on making so on until no more points are leave, the recursion has arrive to an end and the points choose constitute the convex hull.