OPTIMAL DELAUNAY POINT INSERTION

SUMMARY An efficient algorithm for Delaunay triangulation of a given set of points in d dimensions is presented. Various steps of the point insertion algorithm are reviewed and many acceleration procedures are implemented to speed up the triangulation process. New features include the search for a neighbouring point by a layering scheme, locating the containing simplex by a random walk, formulas of important geometrical quantities of a new simplex based on those of an old one, a novel approach in establishing the adjacency relationship using connection matrices. The resulting scheme seems to be one of the fastest triangulation algorithms known, which enables us to generate tetrahedra in R3 with a linear generation rate of 15 OOO tetrahedra per second for randomly generated points on an HP 735 workstation.

[1]  Robin Sibson,et al.  Computing Dirichlet Tessellations in the Plane , 1978, Comput. J..

[2]  Adrian Bowyer,et al.  Computing Dirichlet Tessellations , 1981, Comput. J..

[3]  D. F. Watson.  Computing the n-Dimensional Delaunay Tesselation with Application to Voronoi Polytopes , 1981, Comput. J..

[4]  F. Hermeline,et al.  Triangulation automatique d'un polyèdre en dimension $N$ , 1982 .

[5]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[6]  L. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi , 1985, TOGS.

[7]  Jean-Daniel Boissonnat,et al.  The hierarchical representation of objects: the Delaunay tree , 1986, SCG '86.

[8]  Charles L. Lawson,et al.  Properties of n-dimensional triangulations , 1986, Comput. Aided Geom. Des..

[9]  N. Weatherill.  The integrity of geometrical boundaries in the two‐dimensional delaunay triangulation , 1990 .

[10]  Paul-Louis George,et al.  Fully automatic mesh generator for 3D domains of any shape , 1990, IMPACT Comput. Sci. Eng..

[11]  P. George,et al.  Automatic mesh generator with specified boundary , 1991 .

[12]  P. George,et al.  Delaunay's mesh of a convex polyhedron in dimension d. application to arbitrary polyhedra , 1992 .

[13]  N. Weatherill,et al.  Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints , 1994 .

[14]  H. Borouchaki.  TRIANGULATION DE DELAUNAY SOUS CONTRAINTES DANS R2 , 1994 .