论文信息 - Delaunay triangulation programs on surface data

Delaunay triangulation programs on surface data

The Delaunay triangulation of a set of points in 3D can have size Θ(n2) in the worst case, but this is rarely if ever observed in practice. We compare three production-quality Delaunay triangulation programs on some 'real-world' sets of points lying on or near 2D surfaces.

Sunghee Choi | Nina Amenta

[1] Olivier Devillers. Improved incremental randomized Delaunay triangulation , 1998, SCG '98.

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

[3] Ernst P. Mücke,et al. Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations , 1996, SCG '96.

[4] Kurt Mehlhorn,et al. Four Results on Randomized Incremental Constructions , 1992, Comput. Geom..

[5] Jeff Erickson,et al. Nice Point Sets Can Have Nasty Delaunay Triangulations , 2001, SCG '01.

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