Abstract
Several algorithms have been developed for Delaunay triangulation based on the definitions and the theory of the previous chapter. The popularity of the Delaunay triangulation is twofold. It yields “good shaped” triangles (in the plane) and the theory, mainly based on its dual, the Voronoi diagram, is well established. Other types of triangulation, such as triangulations that are optimal in the sense of the MinMax angle criterion, are difficult to compute in reasonable time from a large number of points. In fact, the Delaunay swapping criteria, which were shown to be equivalent in Section 3.6, are the only known criteria that can be used in Lawson’s local optimization procedure (LOP) to guarantee a globally optimal triangulation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer
About this chapter
Cite this chapter
Hjelle, Ø., Dæhlen, M. (2006). Algorithms for Delaunay Triangulation. In: Triangulations and Applications. Mathematics and Visualization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-33261-8_4
Download citation
DOI: https://doi.org/10.1007/3-540-33261-8_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33260-2
Online ISBN: 978-3-540-33261-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)