Abstract. This paper presents an implementation for Delaunay triangulations of three-dimensional point sets. The code uses a variant of the randomized incremental flip algorithm and employs symbolic perturbation to achieve robustness. The algorithm's theoretical time complexity is quadratic in n, the number of input points, and this is optimal in the worst case. However, empirical running times are proportional to the number of triangles in the final triangulation, which is typically linear in n. Even though the symbolic perturbation scheme relies on exact arithmetic, the resulting code is efficient in practice. This is due to a careful implementation of the geometric primitives and the arithmetic module. The source code is available on the Internet."

Postscript [135k] of April 12, 1995

Suggested BIBTeX entry:

@article{LABEL
,author=        "M{\"u}cke, E. P."
,title=         "A Robust Implementation for
                three-dimensional {Delaunay} Triangulations"
,journal=       "International Journal of Computational Geometry \& Applications"
,volume=        8
,number=        2
,year=          1998
,pages=         "255-276"
,url=           "http://www.geom.umn.edu/locate/cglist/GeomDir/detri95.html"
}