Complexity of the Delaunay triangulation of points on surfaces: The smooth case

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2003, Pages 201-210

  Attali, Dominique ^a   Boissonnat, Jean Daniel ^b   Lieutier, André ^c  

^a ENSIEG   (France)

^b INRIA   (France)

^c DASSAULT SYSTÈMES   (France)

Author keywords

Complexity; Delaunay triangulation; Generic surfaces; Reconstruction; Smooth surfaces; Voronoi diagram

Indexed keywords

COMPUTATIONAL COMPLEXITY; EDGE DETECTION; GRAPH THEORY; IMAGE RECONSTRUCTION; SURFACES;

DELAUNAY TRIANGULATION;

COMPUTATIONAL GEOMETRY;

EID: 0037700499     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/777792.777823     Document Type: Conference Paper

References (14)

1. Nina Amenta and Marshall Bern. Surface reconstruction by voronoi filtering. Discrete Comput. Geom., 22:481-504, 1999.
2. Dominique Attali and Jean-Daniel Boissonnat. A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces. In Proc. 7th ACM Symposium on Solid Modeling and Applications, pages 139-145, 2002.
3. A. G. Belyaev, E. V. Anoshkina, and T. L. Kunii. Ridges, ravines and singularities. In A. T. Fomenko and T. L. Kunii, editors, Topological Modeling for Visualization. Springer, 1997.
4. Jean-Daniel Boissonnat. Geometric structures for three-dimensional shape representation. ACM Trans. Graph., 3(4):266-286, 1984.
5. Jean-Daniel Boissonnat and Frédéric Cazals. Smooth surface reconstruction via natural neighbour interpolati on of distance functions. Comp. Geometry Theory and Applications, pages 185-203, 2002.
6. 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.
7. Olivier Devillers. The Delaunay hierarchy. Internat. J. Found. Comput. Sci., 13:163-180, 2002.
8. T. K. Dey. Curve and surface reconstruction. In in Handbook of Discrete and Computational Geometry, Goodman and O' Rourke eds., CRC press, 2nd edition 2001.
9. T. K. Dey, J. Giesen, and J. Hudson. Delaunay based shape reconstruction from large data. In Proc. IEEE Symposium in Parallel and Large Data Visualization and Graphics, pages 19-27, 2001.
10. Jeff Erickson. Nice point sets can have nasty Delaunay triangulations. In Proc. 17th Annu. ACM Sympos. Comput. Geom., pages 96-105, 2001.
11. Jeff Erickson. Dense point sets have sparse delaunay triangulations. In Proc. of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002. To appear. http://www.cs.ust.hk/tcsc/RR/.
12. Mordecai Golin and HyeonSuk 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.
13. Mordecai J. Golin and Hyeon-Suk Na. The probabilistic complexity of the voronoi diagram of points on a polyhedron. In Proc. 14th Annu. ACM Sympos. Comput. Geom., pages 209-216, 2002.
14. Laurent Schwartz. Analyse, Topologie générale et analyse fonctionnelle. Hermann, 1970. Deuxième édition revue et corrigée.