Abstract

Delaunay triangulations and Voronoi diagrams are one of the most thoroughly studies objects in computational geometry, with numerous applications including nearest-neighbor searching, clustering, finite-element mesh generation, deformable surface modeling, and surface reconstruction. Many algorithms in these application domains begin by constructing the Delaunay triangulation or Voronoi diagram of a set of points in R³. Since three-dimensional Delaunay triangulations can have complexity Ω(n²) in the worst case, these algorithms have worst-case running time \Omega (n2). However, this behavior is almost never observed in practice except for highly-contrived inputs. For all practical purposes, three-dimensional Delaunay triangulations appear to have linear complexity. This frustrating

Citations

1567	Randomized Algorithms - Motwani, Raghavan - 1995
460	Multiresolution analysis of arbitrary meshes - ECK, DEROSE, et al. - 1995
357	Applications of random sampling in computational geometry - Shor - 1989
353	Spatial tessellations: Concepts and Applications of Voronoi diagrams - Okabe, Boots, et al. - 2000
297	A new voronoi-based surface reconstruction algorithm - Amenta, Bern, et al. - 1998
275	Computational Geometry: An Introduction Through Randomized Algorithms - Mulmuley - 1993
273	Surface reconstruction by Voronoi filtering - Amenta, Bern - 1999
222	Erickson Geometric range searching and its relatives - Agarwal, J - 1998
214	A decomposition of multidimensional point sets with application to k-nearest-neighbors and n-body potential fields - Callahan, Kosaraju - 1995
201	The Geometry of Discrete Groups - Beardon - 1983
191	MAPS: Multiresolution adaptive parameterization of surfaces - Lee, Sweldens, et al. - 1998
179	The Geometry and Topology of 3–manifolds - Thurston - 1978
172	A simple algorithm for homeomorphic surface reconstruction - Amenta, Choi, et al. - 2000
172	Provably good mesh generation - BERN, EPPSTEIN, et al. - 1994
151	Geometry and Topology for Mesh Generation - Edelsbrunner - 2001
143	Randomized incremental construction of Delaunay and Voronoi diagrams - Guibas, Knuth, et al. - 1992
140	K.: The power crust, unions of balls, and the medial axis transform - AMENTA, CHOI, et al.
128	Incremental topological flipping works for regular triangulations - Edelsbrunner, Shah - 1992
124	On the shape of a set of points in the plane - Edelsbrunner, Kirkpatrick, et al. - 1983
110	Geometry and the Imagination - HILBERT, COHN-VOSSEN - 1999
104	A randomized algorithm for closest-point queries - Clarkson - 1988
99	Nearest neighbor queries in metric spaces - Clarkson - 1999
96	Tetrahedral mesh generation by delaunay refinement - Shewchuk - 1998
91	Smooth surface reconstruction via natural neighbour interpolation of distance functions - Boissonnat, Cazals - 2000
87	Realistic input models for geometric algorithms - Berg, Katz, et al. - 1997
85	Three-dimensional geometry and topology, Vol.1 - Thurston - 1997
80	Optimal expected-time algorithms for closest point problems - Bentley, Weide, et al. - 1980
76	Cutting hyperplanes for divide-and-conquer - Chazelle - 1993
72	A delaunay based numerical method for three dimensions: generation, formulation, and partition - Miller, Talmor, et al. - 1995
71	Visual complex analysis - Needham - 1997
65	Constructing higher dimensional convex hulls at logarithmic cost per face - Seidel - 1986
64	Sliver exudation - Cheng, Dey, et al.
62	Separators for sphere-packings and nearest neighbor graphs - Miller, Teng, et al.
60	Voronoi diagrams from convex hulls - Brown - 1979
60	Higher-dimensional voronoi diagram in linear expected time - Dwyer - 1991
55	Euclidean minimum spanning trees and bichromatic closest pairs - Agarwal, Edelsbrunner, et al. - 1991
51	Applications of weighted voronoi diagrams and randomization to variance-based -clustering (extended abstract - Inaba, Katoh, et al. - 1994
50	Range searching with efficient hierarchical cuttings - Matouˇsek - 1993
45	Dynamic Skin Triangulation - CHENG, DEY, et al.
45	Spheres, molecules, and hidden surface removal - Halperin, Overmars - 1994
44	Nice point sets can have nasty Delaunay triangulations - Erickson - 2001
44	The flow complex: a data structure for geometric modeling - Giesen, John
40	Deformable smooth surface design - Edelsbrunner - 1999
39	Cutting hyperplanes for divide-and-conquer, Discrete Comput - Chazelle - 1993
36	Computing and Verifying Depth Orders - Berg, Overmars, et al. - 1991
36	Geometric matching under noise: Combinatorial bounds and algorithms - Indyk, Motwani, et al. - 1999
36	Complexity of the Delaunay triangulation of points on surfaces: the smooth case - Attali, Boissonnat, et al. - 2003
36	Surface reconstruction by wrapping finite point sets in space - Edelsbrunner - 1996
36	Well-Spaced Points for Numerical Methods - TALMOR - 1997
34	Smooth-surface reconstruction in near-linear time - Funke, Ramos - 2002