Delaunay triangulation in three dimensions

Triangulation in two and higher dimensions began with Dirichlet, Voronoi, Thiessen, and Delaunay. A number of textbooks and papers have extensively covered the properties of triangulations and algorithms for their construction. Most dealt with theoretical aspects of the algorithms and gave upper bounds on their complexity. Here we present a new algorithm and its implementation. Instead of providing a theoretical analysis, we present implementation details, and tests and examples. The algorithm is a generalization of our previous method