2010Journal of Computer ApplicationsRequires access

Voronoi diagram generation algorithm based on Delaunay triangulation

Yongqiang Ma

Open publisher page 1 citations

Abstract

Considering the problem that the algorithm of building auto-connected Delaunay triangulation and indirectly building Voronoi diagram is of low efficiency,an improved Voronoi generation algorithm based on auto-connected Delaunay triangulation was presented.The seed triangle was rapidly generated by one side of the convex hull.The notion of half closed-border-point was proposed.The algorithm removed closed-points and half closed-border-points in the process of expanding triangle and improved the speed of generating Delaunay triangulation.Then,the notion of ordered target triangle was defined.It quickly found ordered target triangles and generated the non-ray Voronoi diagram.Considering the characteristics of convex hull,a ray Voronoi diagram was generated by three infinite points.The experimental results show that the efficiency of the improved algorithm is obviously improved.

About this research paper

What this paper is about

Considering the problem that the algorithm of building auto-connected Delaunay triangulation and indirectly building Voronoi diagram is of low efficiency,an improved Voronoi generation algorithm based on auto-connected Delaunay triangulation was presented.The seed triangle was rapidly generated by one side of the convex hull.The notion of half closed-border-point was proposed.The algorithm removed closed-points and half closed-border-points in the process of expanding triangle and improved the speed of generating Delaunay triangulation.Then,the notion of ordered target triangle was defined.It quickly found ordered target triangles and generated the non-ray Voronoi diagram.Considering the characteristics of convex hull,a ray Voronoi diagram was generated by three infinite points.The experimental results show that the efficiency of the improved algorithm is obviously improved.

Why it matters

OpenAlex reports 1 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

Considering the problem that the algorithm of building auto-connected Delaunay triangulation and indirectly building Voronoi diagram is of low efficiency,an improved Voronoi generation algorithm based on auto-connected Delaunay triangulation was presented.The seed triangle was rapidly generated by one side of the convex hull.The notion of half closed-border-point was proposed.The algorithm removed closed-points and half closed-border-points in the process of expanding triangle and improved the speed of generating Delaunay triangulation.Then,the notion of ordered target triangle was defined.It quickly found ordered target triangles and generated the non-ray Voronoi diagram.Considering the characteristics of convex hull,a ray Voronoi diagram was generated by three infinite points.The experimental results show that the efficiency of the improved algorithm is obviously improved.

Key concepts: Voronoi diagram, Bowyer–Watson algorithm, Delaunay triangulation, Pitteway triangulation, Constrained Delaunay triangulation, Centroidal Voronoi tessellation, Convex hull, Power diagram

Related papers

Back to paper searchBrowse research topicsOriginal source
Voronoi diagram generation algorithm based on Delaunay triangulation — Research Paper | ScholarLens