A comparison of sequential Delaunay triangulation algorithms

Computational Geometry: Theory and Applications

Volumn 7, Issue 5-6, 1997, Pages 361-385

  Su, Peter ^a   Scot Drysdale, Robert L ^b  

^a NATIONAL ENERGY TECHNOLOGY LABORATORY   (United States)

^b Dartmouth Department of Computer Science_Dartmouth College   (United States)

Author keywords

Delaunay triangulation; Experimental analysis of algorithms; Practical algorithms; Voronoi diagram

Indexed keywords

EID: 0004457536     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(96)00025-9     Document Type: Article

References (27)

1. B. Alpern, L. Carter and E. Feig, Uniform memory hierarchies, in: Proc. ACM Sympos. Theory Comput. (1990) 600-608.
2. C.B. Barber, Computational geometry with imprecise data and arithmetic, Ph.D. Thesis, Princeton (1993).
3. J.L. Bentley, K-d trees for semidynamic point sets, in: Proc. 6th Ann. ACM Sympos. Comput. Geom. (1990) 187-197.
4. J.L. Bentley, B.W. Weide and A.C. Yao, Optimal expected time algorithms for closest point problems, ACM Trans. Math. Software 6 (4) (1980) 563-580.
5. J.-D. Boissonnat and M. Teillaud, On the randomized construction of the Delaunay tree, Theor. Comput. Sci. 112 (1993) 339-354.
6. K. Brown, Voronoi diagrams from convex hulls, IPL (1979) 223-228.
7. K.L. Clarkson and P.W. Shor, Applications of random sampling in computational geometry II, Discrete Comput. Geom. 4 (1989) 387-421.
8. R.A. Dwyer, A faster divide-and-conquer algorithm for constructing Delaunay triangulations, Algorithmica 2 (1987) 137-151.
9. R.A. Dwyer, Higher-dimensional Voronoi diagrams in linear expected time, Discrete Comput. Geom. 6 (1991) 343-367.
10. H. Edelsbrunner and R. Seidel, Voronoi diagrams and arrangements, Discrete Comput. Geom. 1 (1986) 25-44.
11. S. Fortune, A sweepline algorithm for Voronoi diagrams, Algorithmica 2 (1987) 153-174.
12. S. Fortune, Stable maintenance of point-set triangulations in two dimensions, in: Proc. IEEE Sympos. Found. Comput. Sci. (1989) 494-499.
13. S. Fortune, Numerical stability of algorithms for Delaunay triangulations and Voronoi diagrams, in: Proc. Ann. ACM Sympos. Comput. Geom. (1992).
14. M.T. Goodrich, J.-J. Tsay, D.E. Vengroff and J.S. Vitter, External-memory computational geometry, in: Proc. 34th Sympos. Found. Comput. Sci. (1993).
15. P. Green and R. Sibson, Computing Dirichlet tessellations in the plane, Comput. J. 21 (1977) 168-173.
16. L. Guibas, D. Knuth and M. Sharir, Randomized incremental construction of Delaunay and Voronoi diagrams, Algorithmica 7 (1992) 381-413.
17. L. Guibas and J. Stolfi, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams, ACM Trans. Graphics 4 (2) (1985) 75-123.
18. J. Katajainen and M. Koppinen, Constructing Delaunay triangulations by merging buckets in quad-tree order, unpublished manuscript (1987).
19. A. Maus, Delaunay triangulation and the convex hull of n points in expected linear time, BIT 24 (1984) 151-163.
20. T. Ohya, M. Iri and K. Murota, Improvements of the incremental method for the Voronoi diagram with computational comparison of various algorithms, J. Oper. Res. Soc. Japan 27 (1984) 306-337.
21. F.P. Preparata and S.J. Hong, Convex hulls of finite sets of points in two and three dimensions, Comm. ACM 20 (1977) 87-93.
22. L.A. Santaló, Integral Geometry and Geometric Probability (Addison-Wesley, Reading, MA, 1976).
23. M. Sharir and E. Yaniv, Randomized incremental construction of Delaunay diagrams: Theory and practice, in: Proc. Ann. ACM Sympos. Comput. Geom. (1991).
24. P. Su, Efficient parallel algorithms for closest point problems, Technical Report, Dartmouth College (November 1994).
25. M. Tanemura, T. Ogawa and N. Ogita, A new algorithm for three dimensional Voronoi tessellation, J. Comput. Phys. 51 (1983) 191-207.
26. J.S. Vitter, Efficient memory access in large-scale computation, in: Proc. Ann. Sympos. Theor. Comput. Sci. (1991).
27. J.S. Vitter and E.A.M. Shriver, Optimal algorithms for parallel memory I: Two-level memories, Algorithmica 12 (1994) 110-147.