Two algorithms for constructing a Delaunay triangulation
- Cite this article as:
- Lee, D.T. & Schachter, B.J. International Journal of Computer and Information Sciences (1980) 9: 219. doi:10.1007/BF00977785
- 1.9k Downloads
This paper provides a unified discussion of the Delaunay triangulation. Its geometric properties are reviewed and several applications are discussed. Two algorithms are presented for constructing the triangulation over a planar set ofN points. The first algorithm uses a divide-and-conquer approach. It runs inO(N logN) time, which is asymptotically optimal. The second algorithm is iterative and requiresO(N2) time in the worst case. However, its average case performance is comparable to that of the first algorithm.
Key wordsDelaunay triangulation triangulation divide-and-conquer Voronoi tessellation computational geometry analysis of algorithms
Unable to display preview. Download preview PDF.