摘要：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 trianagles of edges information is dynamically updated. Theoretical analysis and experimental results show that the proposed algorithm is an efficient method of generating Voronoi diagram.
关键词：computational geometry;planar point set;voronoi diagrams;delaunay triangulations
