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.
Issue Date
2002-01-01
Language
ENG
Citation
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms , pp.135 - 136