A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces

Discrete and Computational Geometry

Volumn 31, Issue 3, 2004, Pages 369-384

  Attali, Dominique ^a   Boissonnat, Jean Daniel ^b  

^a ENSIEG   (France)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1842765491     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-003-2870-4     Document Type: Article

References (23)

1. N. Amenta and M. Bern. Surface reconstruction by Voronoi filtering. Discrete Comput. Geom., 22:481-504, 1999.
2. N. Amenta, M. Bern, and M. Kamvysselis. A new Voronoi-based surface reconstruction algorithm. In Proc. SIGGRAPH '98, pages 415-412, July 1998.
3. N. Amenta, S. Choi, T. K. Dey, and N. Leekha. A simple algorithm for homeomorphic surface reconstruction. In Proc. 16th Annu. ACM Sympos. Comput. Geom., pages 213-222, 2000.
4. N. Amenta and R. K. Kolluri. Accurate and efficient unions of balls. In Proc. 16th Annu. ACM Sympos. Comput. Geom., pages 119-128, 2000.
5. D. Attali and J.-D. Boissonnat. Complexity of the Delaunay triangulation of points on polyhedral surfaces. Discrete Comput. Geom., 30: 437-452, 2003.
6. F. Bernardini, C. L. Bajaj, J. Chen, and D. R. Schikore. Automatic reconstruction of 3D CAD models from digital scans. Internat. J. Comput. Geom. Appl., 9:327-369, 1999.
7. F. Bernardini, J. Mittleman, H. Rushmeier, C. Silva, and G. Taubin. The ball-pivoting algorithm for surface reconstruction. IEEE Trans. Visual. Comput. Graphics, 5(4):349-359, 1999.
8. J.-D. Boissonnat. Geometric structures for three-dimensional shape representation. ACM Trans. Graphics, 3(4):266-286, October 1984.
9. J.-D. Boissonnat and F. Cazals. Natural neighbour coordinates of points on a surface. Comput. Geom. Theory Appl., 19(2-3):155-173, July 2001.
10. J.-D. Boissonnat and F. Cazals. Smooth surface reconstruction via natural neighbour interpolation of distance functions. Comput. Geom. Theory Appl., 22(1):185-203, 2002.
11. J.-D. Boissonnat and M. Yvinec. Algorithmic Geometry. Cambridge University Press, Cambridge, 1998. Translated by Hervé Brönnimann.
12. T. M. Chan, J. Snoeyink, and C. K. Yap. Primal dividing and dual pruning: output-sensitive construction of 4-d polytopes and 3-d Voronoi diagrams. Discrete Comput. Geom., 18:433-454, 1997.
13. L. P. Chew. Guaranteed-quality mesh generation for curved surfaces. In Proc. 9th Annu. ACM Sympos. Comput. Geom., pages 274-280, 1993.
14. S. Choi and N. Amenta. Delaunay triangulation programs on surface data. In Proc. 13th ACM-SIAM Sympos. Discrete Algorithms, pages 135-136, 2002.
15. R. A. Dwyer. Higher-dimensional Voronoi diagram in linear expected time. Discrete Comput. Geom., 6:343-367, 1991.
16. R. A. Dwyer. The expected number of k-faces of a Voronoi diagram. Internat. J. Comput. Math., 26(5):13-21, 1993.
17. H. Edelsbrunner. Deformable smooth surface design. Discrete Comput. Geom., 21:87-115, 1999.
18. J. Erickson. Nice point sets can have nasty Delaunay triangulations. In Proc. 17th Annu. ACM Sympos. Comput. Geom., pages 96-105, 2001.
19. J. Erickson. Dense point sets have sparse Delaunay triangulations. In Proc. 13th ACM-SIAM Sympos. Discrete Algorithms, pages 125-134, 2002.
20. M. J. Golin and H.-S. Na. On the average complexity of 3d-Voronoi diagrams of random points on convex polytopes. In Proc. 12th Canad. Conf. Comput. Geom., pages 127-135, 2000.
21. M. J. Golin and H.-S. Na. The probabilistic complexity of the Voronoi diagram of points on a polyhedron. In Proc. ACM Sympos. Comput. Geom., pages 209-216, Barcelona, June 2002.
22. S. Joshi, S. Pizer, P. T. Fletcher, P. Yushkevich, A. Thall, and J. S. Marron. Multiscal deformable model segmentation and statistical shape using medial descriptions. IEEE Trans. Medical Imaging, 21(5):538-550, May 2002.
23. D. J. Sheehy, C. G. Armstrond, and D. J. Robinson. Computing the medial surface of a solid from a domain Delaunay triangulation. In Proc. 3rd Sympos. Solid Modeling Appl., pages 201-212, May 1995.