Fast Delaunay triangulation in three dimensions

[1]  William H. Frey,et al.  An apporach to automatic three‐dimensional finite element mesh generation , 1985 .

[2]  Jeffrey L. Brown,et al.  Vertex based data dependent triangulations , 1991, Comput. Aided Geom. Des..

[3]  S. H. Lo,et al.  Delaunay triangulation of non‐convex planar domains , 1989 .

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

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

[6]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[7]  Arne Maus,et al.  Delaunay triangulation and the convex hull ofn points in expected linear time , 1984, BIT.

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

[9]  Barry Joe,et al.  Construction of three-dimensional Delaunay triangulations using local transformations , 1991, Comput. Aided Geom. Des..

[10]  A. Jack,et al.  Aspects of three‐dimensional constrained Delaunay meshing , 1994 .

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

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

[13]  Thomas S. Huang,et al.  A survey of construction and manipulation of octrees , 1988, Comput. Vis. Graph. Image Process..

[14]  V. T. Rajan.  Optimality of the Delaunay triangulation in ℝd , 1994, Discret. Comput. Geom..

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