A Comparison of Sequential Delaunay Triangulation Algorithms

@article{Su1995ACO,
  title={A Comparison of Sequential Delaunay Triangulation Algorithms},
  author={Peter Su and Robert L. Scot Drysdale},
  journal={Comput. Geom.},
  year={1995},
  volume={7},
  pages={361-385}
}
This paper presents an experimental comparison of a number of different algorithms for computing the Deluanay triangulation. The algorithms examined are: Dwyer’s divide and conquer algorithm, Fortune’s sweepline algorithm, several versions of the incremental algorithm (including one by Ohya, Iri, and Murota, a new bucketing-based algorithm described in this paper, and Devillers’s version of a Delaunay-tree based algorithm that appears in LEDA), an algorithm that incrementally adds a correct… CONTINUE READING
75 Citations
7 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Computational geometry with imprecise data and arithmetic

  • C. Brad Barber
  • PhD thesis, Princeton,
  • 1993
Highly Influential
4 Excerpts

Randomized incremental construction of delaunay diagrams: Theory and practice

  • M. Sharir, E. Yaniv
  • Annual ACM Symposium on Computational Geometry,
  • 1991
Highly Influential
5 Excerpts

Constructing delaunay triangulations bymerging buckets in quad-tree order

  • J. Katajainen, M. Koppinen
  • Unpublished manuscript,
  • 1987
Highly Influential
5 Excerpts

Improvements of the incremental method for the voronoi diagram with computational comparison of various algorithms

  • T. Ohya, M. Iri, K. Murota
  • Journal fo the Operations Research Society of…
  • 1984
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…