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.
- Issue Date
- 2002-01-01
- Language
- ENG
- Citation
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms , pp.135 - 136
- Appears in Collection
- CS-Conference Papers(학술회의논문)
- Files in This Item
- CA02.pdf(167.31 kB)Download
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.