A comparison of sequential delaunay triangulation algorithms

Proceedings of the Annual Symposium on Computational Geometry

Volumn Part F129372, Issue , 1995, Pages 61-70

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

^a Transarc Corporation The Gulf Tower ^*  (United States)

^b DARTMOUTH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84994426891     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/220279.220286     Document Type: Conference Paper

References (19)

1. C. Brad Barber. Computational geometry with imprecise data and arithmetic. PhD thesis, Princeton, 1993.
2. J. L. Bentley. Experiments on travel salesman heuristics. ACM-SIAM Symposium on Discrete Algorithms, pages 91-99, 1989.
3. J. L. Bentley. K-d trees for semidynamic point sets. Proc. 6th Annual ACM Symposium on Computational Geometry, pages 187-197, 1990.
4. J. L. Bentley, B. W. Weide, and A. C. Yao. Optimal expected time algorithms for closest point problems. ACM Transactions on Mathematical Software, 6(4):563-580, 1980.
5. K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, ii. Discrete and Computational Geometry, 4:387-421, 1989.
6. R. A. Dwyer. A faster divide-and-conquer algorithm for constructing delaunay triangulations. Algorithmica, 2:137-151, 1987.
7. R. A. Dwyer. Higher-dimensional voronoi diagrams in linear expected time. Discrete & Computational Geometry, 6:343-367, 1991.
8. S. Fortune. A sweepline algorithm for voronoi diagrams. Algorithmica, 2:153-174, 1987.
9. P. Green and R. Sibson. Computing dirichlet tessellations in the plane. Computing Journal, 21:168-173, 1977.
10. L. Guibas, D. Knuth, and M. Sharir. Randomized incremental construction of delaunay and voronoi diagrams. Algorithmica, 7:381-413, 1992.
11. L. Guibas and J. Stolfi. Primitives for the manipulation of general subdivisions and the computation of voronoi diagrams. ACM Transactions on Graphics, 4(2):75-123, 1985.
12. J. Katajainen and M. Koppinen. Constructing delaunay triangulations by merging buckets in quad-tree order. Unpublished manuscript, 1987.
13. A. Maus. Delaunay triangulation and the convex hull of n points in expected linear time. BIT, 24:151-163, 1984.
14. C. McGeoch. Experimental Analysis of Algorithms. PhD thesis, School of Computer Science, CMU, 1986.
15. T. Ohya, M. Iri, and K. Murota. Improvements of the incremental method for the voronoi diagram with computational comparison of various algorithms. Journal fo the Operations Research Society of Japan, 27:306-337, 1984.
16. L. A. Santaló. Integral Geometry and Geometric Probability. Addison-Wesley, Reading, MA, 1976.
17. M. Sharir and E. Yaniv. Randomized incremental construction of delaunay diagrams: Theory and practice. Annual ACM Symposium on Computational Geometry, 1991.
18. M. Tanemura, T. Ogawa, and N. Ogita. A new algorithm for three dimensional voronoi tessellation. Journal of Computational Physics, 51:191-207, 1983.
19. B. Weide. Statistical Methods for the Analysis of Algorithms. PhD thesis, School of Computer Science, CMU, 1978.