Flipping to robustly delete a vertex in a Delaunay tetrahedralization

Lecture Notes in Computer Science

Volumn 3480, Issue I, 2005, Pages 737-747

  Ledoux, Hugo ^a   Gold, Christopher M ^a   Baciu, George ^b  

^a UNIVERSITY OF GLAMORGAN   (United Kingdom)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS);

BISTELLAR FLIPS; DELAUNAY TETRAHEDRALIZATION; SINGLE VERTEX;

COMPUTER SCIENCE;

EID: 24944443434     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11424758_76     Document Type: Conference Paper

References (16)

1. Joe, B.: Construction of three-dimensional Delaunay triangulations using local transformations. Computer Aided Geometric Design 8 (1991) 123-142
2. d. Computer-Aided Design 30 (1998) 333-341
3. Watson, D.F.: Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes. Computer Journal 24 (1981) 167-172
4. Chew, L.P.: Building Voronoi diagrams for convex polygons in linear expected time. Technical Report PCS-TR90-147, Dartmouth College, Computer Science, Hanover, NH (1990)
5. Devillers, O.: On deletion in Delaunay triangulations. International Journal of Computational Geometry and Applications 12 (2002) 193-205
6. Mostafavi, M.A., Gold, C.M., Dakowicz, M.: Delete and insert operations in Voronoi/Delaunay methods and applications. Computers & Geosciences 29 (2003) 523-530
7. Devillers, O., Teillaud, M.: Perturbations and vertex removal in a 3D Delaunay triangulation. In: Proceedings 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore, MD, USA (2003) 313-319
8. Seidel, R.: The nature and meaning of perturbations in geometric computing. Discrete & Computational Geometry 19 (1998) 1-17
9. Edelsbrunner, H., Seidel, R.: Voronoi diagrams and arrangements. Discrete & Computational Geometry 1 (1986) 25-44
10. Joe, B.: Three-dimensional triangulations from local transformations. SIAM Journal on Scientific and Statistical Computing 10 (1989) 718-741
11. d. In: Proceedings 7th Annual Symposium on Computational Geometry, North Conway, New Hampshire, USA, ACM Press (1991) 357-363
12. Schönhardt, E.: Über die Zerlegung von dreieckspolyedern in tetraeder. Mathematische Annalen 98 (1928) 309-312
13. Lawson, C.L.: Properties of n-dimensional triangulations. Computer Aided Geometric Design 3 (1986) 231-246
14. Shewchuk, J.R.: Updating and constructing constrained Delaunay and constrained regular triangulations by flips. In: Proceedings 19th Annual Symposium on Computational Geometry, San Diego, USA, ACM Press (2003) 181-190
15. Edelsbrunner, H., Mücke, E.P.: Simulation of Simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics 9 (1990) 66-104
16. Shewchuk, J.R.: Sweep algorithms for constructing higher-dimensional constrained Delaunay triangulations. In: Proceedings 16th Annual Symposium on Computational Geometry, Hong Kong, ACM Press (2000) 350-359