ScholarLens Back to search
2006•Computer-aided engineeringRequires access

Implementation of Voronoi diagram algorithms for 3D point set

Liu Xuena

Open publisher page 2 citations

Abstract

Based on the deep research on the construction algorithms of 3D Voronoi diagram, the algorithm of constructing the Voronoi diagram from a Delaunay triangulation is proposed and implemented. Delaunay triangulation is achieved by using randomized incremental local transformation. Then its Voronoi diagram is created according to the dual property. The algorithm is highly robust and adapt to any non-coplanar 3D point set.

About this research paper

What this paper is about

Based on the deep research on the construction algorithms of 3D Voronoi diagram, the algorithm of constructing the Voronoi diagram from a Delaunay triangulation is proposed and implemented. Delaunay triangulation is achieved by using randomized incremental local transformation. Then its Voronoi diagram is created according to the dual property. The algorithm is highly robust and adapt to any non-coplanar 3D point set.

Why it matters

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

Based on the deep research on the construction algorithms of 3D Voronoi diagram, the algorithm of constructing the Voronoi diagram from a Delaunay triangulation is proposed and implemented. Delaunay triangulation is achieved by using randomized incremental local transformation. Then its Voronoi diagram is created according to the dual property. The algorithm is highly robust and adapt to any non-coplanar 3D point set.

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

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Implementation of Voronoi diagram algorithms for 3D point set — Research Paper | ScholarLens