Delaunay triangulation programs on surface data. (English) Zbl 1058.65023
Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, USA, January 6–8, 2002. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-513-X/pbk). 135-136 (2002).
Summary: The Delaunay triangulation of a set of points in 3D can have size \(O(n^2)\) 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.
For the entire collection see [Zbl 1029.00035].
For the entire collection see [Zbl 1029.00035].
MSC:
| 65D18 | Numerical aspects of computer graphics, image analysis, and computational geometry |
