Issue No. 05 - September (1995 vol. 15)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/38.403829
A direct algorithm for computing the Delaunay triangulation in three dimensions is presented. The algorithm uses a 3D cell data structure to preprocess the data, a range searching procedure to find Delaunay points quickly, and a shelling mechanism to put tetrahedra together in such a way that completeness and correctness are guaranteed. A face and an edge lists are used to govern the triangulation process. The convex hull can also be computed at no extra cost.
Les A. Piegl, Tsung-Pao Fang, "Delaunay Triangulation in Three Dimensions", IEEE Computer Graphics and Applications, vol. 15, no. , pp. 62-69, September 1995, doi:10.1109/38.403829