doi: 10.4304/jsw.9.3.777-784
Voronoi Diagram Generation Algorithm based on Delaunay Triangulation
- 1 College of National Territorial Resources and Tourism, Anhui Normal University, Wuhu, China
- 2 Engineering Technology Research Center of Network and Information Security, Anhui Normal University, Wuhu, China
Abstract
Voronoi diagram and its geometric dual, the Delaunay triangulation, both are practical geometric constructions which have been applied extensively in spatial analysis. Considering the low efficiency of the algorithm of indirectly building Voronoi diagram, this paper proposes an improved Voronoi diagram generation algorithm based on Delaunay triangulation of randomly distributed points in the Euclidean plane. In the process of building Delaunay triangulation, correlative edges of points and correlative triangles of edges information is dynamically updated. Theoretical analysis and experimental results show that the proposed algorithm is an efficient method of generating Voronoi diagram.
Keywords
- computational geometry
- planar point set
How to Cite
Liping Sun, Yonglong Luo, Yalei Yu, and Xintao Ding, "Voronoi Diagram Generation Algorithm based on Delaunay Triangulation," Journal of Software, vol. 9, no. 3, pp. 777-784, 2014. https://doi.org/ 10.4304/jsw.9.3.777-784
Copyright & License
Copyright © 2014 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).