DescriptionThe 3D convex hull of a set of points is the smallest subset
of the space where, for any two points u and v, the segment
joining these two points is in the subset. Several kind of algorithms computes
this subset (Incremental, QuickHull, Divide and Conquer,...)
The algorithm used there is based on the version proposed by O'Rourke in "Computational Geometry
in C" (Second Edition). The original source code can be found there. Nevertheless, this
version implements the incremental algorithm which is not the faster algorithm.
Moreover, the original version works with integers. Despite of its relative
efficiency, you'll find here a C++ version of this code for points with floating
For better results and more general implementation, you can use the CGAL (Computational Geometry Algorithms
Library). Details about the implemented algorithms can be found there.