Perturbations and vertex removal in a 3D delaunay triangulation

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 313-319

  Devillers, Olivier ^a   Teillaud, Monique ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; PERTURBATION TECHNIQUES; PROBLEM SOLVING; THREE DIMENSIONAL;

DELAUNAY TRIANGULATION; VERTEX REMOVAL;

COMPUTATIONAL GEOMETRY;

EID: 0038416079     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. A. Aggarwal, L. J. Guibas, J. Saxe, and P. W. Shor. A linear-time algorithm for computing the Voronoi diagram of a convex polygon. Discrete Comput. Geom., 4(6):591-604, 1989.
2. Pierre Alliez, Olivier Devillers, and Jack Snoeyink. Removing degeneracies by perturbing the problem or the world. Reliable Computing, 6:61-79, 2000. Special Issue on Computational Geometry, to appear.
3. Siu-Wing Cheng and Tamal K. Dey. Quality meshing with weighted Delaunay refinement. In Proc. 13th ACM-SIAM Sympos. Discrete Algorithms, pages 137-146, 2002.
4. Siu-Wing Cheng, Tamal K. Dey, Herbert Edelsbrunner, Michael A. Facello, and Shang-Hua Teng. Sliver exudation. In Proc. 15th Annu. ACM Sympos. Comput. Geom., pages 1-13, 1999.
5. L. P. Chew. Building Voronoi diagrams for convex polygons in linear expected time. Technical Report PCS-TR90-147, Dept. Math. Comput. Sci., Dartmouth College, Hanover, NH, 1986.
6. Olivier Devillers. On deletion in Delaunay triangulation. Internat. J. Comput. Geom. Appl., 12:193-205, 2002.
7. Olivier Devillers, Stefan Meiser, and Monique Teillaud. The space of spheres, a geometric tool to unify duality results on Voronoi diagrams. In Proc. 4th Canad. Conf. Comput. Geom., pages 263-268, 1992. Technical Report INRIA 1620, http://www.inria.fr/rrrt/rr1620.html.
8. Tamal K. Dey and Joachim Giesen. Detecting under-sampling in surface reconstruction. In Proc. 17th Annu. ACM Sympos. Comput. Geom., pages 257-263, 2001.
9. M. B. Dillencourt. Realizability of Delaunay triangulations. Inform. Process. Lett., 33(6):283-287, February 1990.
10. H. Edelsbrunner and E. P. Mücke. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graph., 9(1):66-104, 1990.
11. H. Edelsbrunner and R. Seidel. Voronoi diagrams and arrangements. Discrete Comput. Geom., 1:25-44, 1986.
12. Stefan Funke and Kurt Mehlhorn. Look: A lazy object-oriented kernel for geometric computation. In Proc. 16th Annu. ACM Sympos. Comput. Geom., pages 156-165, 2000.
13. M. Heller. Triangulation algorithms for adaptive terrain modeling. In Proc. 4th Internat. Sympos. Spatial Data Handling, pages 163-174, 1990.
14. F. Hurtado, M. Noy, and J. Urrutia. Flipping edges in triangulations. Discrete Comput. Geom., 22(3):333-346, 1999.
15. Atsuyuki Okabe, Barry Boots, and Kokichi Sugihara. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. John Wiley & Sons, Chichester, UK, 1992.
16. R. Seidel. The nature and meaning of perturbations in geometric computing. Discrete Comput. Geom., 19:1-17, 1998.