Nice Point Sets Can Have Nasty Delaunay Triangulations

We consider the complexity of Delaunay triangulations of sets of point s in $\Real^3$ under certain practical geometric constraints. The \emph{spread} of a set of points is the ratio between the longest and shortest pairwise distances. We show that in the worst case, the Delaunay triangulation of $n$ points in~$\Real^3$ with spread $\Delta$ has complexity $\Omega(\min\set{\Delta^3, n\Delta, n^2})$ and $O(\min\set{\Delta^4, n^2})$. For the case $\Delta = \Theta(\sqrt{n})$, our lower bound construction consists of a uniform sample of a smooth convex surface with bounded curvature. We also construct a family of smooth connected surfaces such that the Delaunay triangulation of any good point sample has near-quadratic complexity.

[1]  Rex A. Dwyer.  Higher-dimensional voronoi diagrams in linear expected time , 1989, SCG '89.

[2]  David Eppstein,et al.  Provably good mesh generation , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[3]  Rex A. Dwyer,et al.  The Expected Number of k-Faces of a Voronoi Diagram , 1993 .

[4]  Leonidas J. Guibas,et al.  Selecting Heavily Covered Points , 1994, SIAM J. Comput..

[5]  Herbert Edelsbrunner,et al.  Three-dimensional alpha shapes , 1994, ACM Trans. Graph..

[6]  S. Rao Kosaraju,et al.  A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields , 1995, JACM.

[7]  Chandrajit L. Bajaj,et al.  Automatic reconstruction of surfaces and scalar fields from 3D scans , 1995, SIGGRAPH.

[8]  Chandrajit L. Bajaj,et al.  Sampling and reconstructing manifolds using alpha-shapes , 1997, CCCG.

[9]  Kenneth L. Clarkson,et al.  Nearest Neighbor Queries in Metric Spaces , 1997, STOC '97.

[10]  Mark de Berg,et al.  Realistic input models for geometric algorithms , 1997, SCG '97.

[11]  Baining Guo,et al.  Surface Reconstruction Using Alpha Shapes , 1997, Comput. Graph. Forum.

[12]  Dominique Attali,et al.  r-regular shape reconstruction from unorganized points , 1997, SCG '97.

[13]  Marshall W. Bern,et al.  Surface Reconstruction by Voronoi Filtering , 1998, SCG '98.

[14]  Jonathan Richard Shewchuk,et al.  Tetrahedral mesh generation by Delaunay refinement , 1998, SCG '98.

[15]  Marshall W. Bern,et al.  A new Voronoi-based surface reconstruction algorithm , 1998, SIGGRAPH.

[16]  David Eppstein,et al.  The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction , 1998, Graph. Model. Image Process..

[17]  Christopher M. Gold,et al.  Crust and anti-crust: a one-step boundary and skeleton extraction algorithm , 1999, SCG '99.

[18]  M. Bern,et al.  Surface Reconstruction by Voronoi Filtering , 1998, SCG '98.

[19]  Herbert Edelsbrunner,et al.  Sliver exudation , 1999, SCG '99.

[20]  Sunghee Choi,et al.  A simple algorithm for homeomorphic surface reconstruction , 2000, SCG '00.

[21]  Jean-Daniel Boissonnat,et al.  Smooth surface reconstruction via natural neighbour interpolation of distance functions , 2000, SCG '00.

[22]  Kokichi Sugihara,et al.  Voronoi-based interpolation with higher continuity , 2000, SCG '00.

[23]  Xiang-Yang Li,et al.  Smoothing and cleaning up slivers , 2000, STOC '00.

[24]  Hyeon-Suk Na,et al.  On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes , 2003, Comput. Geom..

[25]  Ho-Lun Cheng,et al.  Dynamic Skin Triangulation , 2001, SODA '01.

[26]  Stefan Funke,et al.  Surface Reconstruction in almost Linear Time under Locally Uniform Sampling , 2001 .

[27]  Sunghee Choi,et al.  The power crust, unions of balls, and the medial axis transform , 2001, Comput. Geom..