An efficient sweep-line Delaunay triangulation algorithm

CAD Computer Aided Design

Volumn 37, Issue 10, 2005, Pages 1027-1038

  Žalik, Borut ^a  

^a UNIVERSITY OF MARIBOR   (Slovenia)

Author keywords

Computational geometry; Delaunay triangulation; Sweep line paradigm

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTER AIDED DESIGN; GRAPH THEORY; MATHEMATICAL MODELS; OPTIMIZATION; TRIANGULATION;

CONVEX HULL BASED ALGORITHMS; DELAUNAY TRIANGULATION; EMPTY CIRCLE PROPERTIES; SWEEP-LINE PARADIGM;

ALGORITHMS;

EID: 16644381623     PISSN: 00104485     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cad.2004.10.004     Document Type: Article

References (19)

1. P. Su, and R.L.S. Drysdale A comparison of sequential Delaunay triangulation algorithms Proceedings of SCG'95 (ACM Symposium on Computational Geometry) 1995 p. 61-70
2. Guibas L, Stolfi J. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Trans Graph 1985 4(1):75-123.
3. L. Guibas, D. Knuth, and M. Sharir Randomised incremental construction of Delaunay and Voronoi diagrams Algorithmica 7 1992 381 413
4. E.P. Mücke, I. Saias, and B. Zhu Fast randomized point location without preprocessing and two- and three-dimensional Delaunay triangulations Proceedings of SCG'96 (ACM Symposium on Computational Geometry) 1996 p. 274-83
5. I. Kolingerová, and B. Žalik Improvements to randomized incremental delaunay insertion Comput Graph 26 2001 477 490
6. B. Žalik, and I. Kolingerová An incremental construction algorithm for Delaunay triangulation using the nearest-point paradigm Int J Geograph Inf Sci 17 2003 119 138
7. Fang T-P, Piegl L. Delaunay triangulation using a uniform grid. IEEE Comput Graph Appl 1986 13(3):36-47.
8. D.T. Lee, and B.J. Schachter Two algorithms for constructing a delaunay triangulation Int J Comput Inf Sci 9 1980 219 242
9. R.A. Dwyer A faster divide-and-conquer algorithm for constructing Delaunay triangulations Algorithmica 2 1987 137 151
10. H. Edelsbrunner, and R. Seidel Voronoi diagrams in linear expected time Discrete Comput Geom 1 1986 25 44
11. S. Fortune A sweep-line algorithm for Voronoi diagrams Algorithmica 2 1987 153 174
12. C.L. Lawson J.R. Rice Software for C1 surface interpolation. Mathematical software III 1977 Academic Press New York 161 194
13. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf Computational geometry, algorithms and applications 1997 Springer Berlin
14. F.P. Preparata, and M.I. Shamos Computational geometry: an introduction 1985 Springer Berlin
15. F. Aurenhammer Voronoi diagrams - a survey of a fundamental geometric data structure ACM Comput Surveys 3 1991 345 405
16. Boissonnat JD, Devillers O, Teillaud M, Yvinec M. Triangulations in CGAL. In: Computational Geometry 2000. Hong Kong: ACM Press; 2000, p. 11-8.
17. Shewchuk JR. A two-dimensional quality mesh generator, Delaunay triangulator. http://www.cs.berkeley.edu/jrs/index.html ; 2004.
18. J.R. Shewchuk Triangle: engineering a 2D quality mesh generator and delaunay triangulator Proceedings of SCG'96 (ACM Symposium on Computational Geometry) 1996 p. 124-133
19. O. Devillers Improved incremental randomized delaunay triangulation Proceedings of SCG'98 (ACM Symposium on Computational Geometry) 1998 p. 106-15