2014Journal of SoftwareRequires access

Voronoi Diagram Generation Algorithm based on Delaunay Triangulation

Liping Sun, Yonglong Luo, YU Ya-lei, Xintao Ding

Open publisher page 6 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Bowyer–Watson algorithm, Delaunay triangulation, Voronoi diagram, Pitteway triangulation, Centroidal Voronoi tessellation, Constrained Delaunay triangulation, Computer science, Weighted Voronoi diagram

Related papers

Back to paper searchBrowse research topicsOriginal source
Voronoi Diagram Generation Algorithm based on Delaunay Triangulation — Research Paper | ScholarLens