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 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
