An algorithm for determining the convex hull of N points in 3-space PublicDeposited

Descriptions

An algorithm is described for determining the vertices
and supporting planes (or lines) of the convex hull
of a given set of N distinct points in 3-space. The
method involves determining a finite sequence of convex
hulls, each successive convex hull being a better approximation
to the convex hull of the given N points. The
final convex hull being the one desired.
The algorithm is programmed in Fortran I for an IBM
1620 with 40,000 positions of numeric storage. These
programs and several examples are included, along with
proofs for a few of the theorems necessary in the development
of the algorithm.