HCPO: An efficient insertion order for incremental Delaunay triangulation

Information Processing Letters

Volumn 93, Issue 1, 2005, Pages 37-42

  Zhou, Sheng ^a   Jones, Christopher B ^a  

^a CARDIFF UNIVERSITY   (United Kingdom)

Author keywords

Computational geometry; Incremental Delaunay triangulation; Insertion order

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA REDUCTION; HIERARCHICAL SYSTEMS; SAMPLING; SET THEORY;

EDGE FLIPS; INCREMENTAL DELAUNAY TRIANGULATION; INSERTION ORDER; POINT INSERTION;

COMPUTATIONAL GEOMETRY;

EID: 9944246007     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.09.020     Document Type: Article

References (15)

1. N. Amenta, S. Choi, G. Rote, Incremental constructions con BRIO, in: Proc. ACM Symp. on Comput. Geometry, 2003, pp. 211-219.
2. M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf, Computational Geometry: Algorithms and Applications, Springer-Verlag, Berlin, ISBN 3-540-61270-X, 1997.
3. O. Devillers, S. Pion, M. Teillaud, Walking in a triangulation, in: Proc. ACM Symp. on Comput. Geometry, 2001, pp. 106-114.
4. R.A. Dwyer, A faster divide-and-conquer algorithm for constructing Delaunay triangulations, Algorithmica 2 (1987) 137-151.
5. P.J. Green, R. Sibson, Computing Dirichlet tessellations in the plane, Comput. J. 21 (1978) 168-173.
6. L.J. Guibas, J. Stolfi, Primitives for the manipulation of general subdivisions and computation of Voronoi diagrams, ACM Trans. on Graphics 4 (2) (1985) 74-123.
7. L.J. Guibas, D.E. Knuth, M. Sharir, Randomized incremental construction of Delaunay and Voronoi diagrams, Algorithmica 7 (4) (1992) 381-413.
8. C.L. Lawson, Software for Cl surface interpolation, in: J.R. Rice (Ed.), Mathematical Software III, Academic Press, New York, 1977, pp. 161-194.
9. E.P. Mücke, I. Saias, B. Zhu, Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations, Comput. Geometry 12 (1-2) (1999) 63-83.
10. T. Ohya, M. Iri, K. Murota, A fast Voronoi-diagram algorithm with quaternary tree bucketing, Inform. Process. Lett. 18 (1984) 227-231.
11. F.P. Preparata, M.I. Shamos, Computational Geometry: an Introduction, Springer-Verlag, Berlin, ISBN 0-387-96131-3, 1985.
12. J. Shewchuk, Triangle: engineering a 2D quality mesh generator and Delaunay triangulator, in: Proc. WACG'96, 1996, pp. 203-222.
13. J. Shewchuk, Adaptive precision floating-point arithmetic and fast robust geometric predicates, Discrete Comput. Geom. 18 (3) (1997) 305-368.
14. S.W. Sloan, A fast algorithm for constructing Delaunay triangulations in the plane, Adv. Eng. Softw. 9 (1) (1987) 34-55.
15. P. Su, R.L.S. Drysdale III, A comparison of sequential Delaunay triangulation algorithms, Comput. Geometry 7 (1997) 361-385.