Login
TitleDelaunay Triangulation Programs on Surface Data (In Proceedings)
inThe 13th ACM-SIAM Symposium on Discrete Algorithms
Author(s) Sunghee Choi, Nina Amenta
Year 2002
Pages135--136
Download
BibTeX
Abstract The Delaunay triangulation of a set of points in 3D can 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