ScholarLens Back to search
2006•The Journal of The Institute of Image Information and Television EngineersOpen access

A Two-Scan Algorithm for Weighted Voronoi Tessellations

Kohei Inoue, Kenji Hara, Kiichi Urahama

Open full text 1 citations

Abstract

We developed a two-scan algorithm for discrete Voronoi tessellations of digital images. The computation time of our method is independent of the number of Voronoi sites. In addition to the previous additively, multiplicatively, compoundly weighted Voronoi diagrams and the additively weighted power Voronoi diagram, we proposed a new weighted Voronoi diagram, namely the compoundly weighted power Voronoi diagram. These five weighted Voronoi diagrams were efficiently computed with our two-scan algorithm.

Open-access reader

About this research paper

What this paper is about

We developed a two-scan algorithm for discrete Voronoi tessellations of digital images. The computation time of our method is independent of the number of Voronoi sites. In addition to the previous additively, multiplicatively, compoundly weighted Voronoi diagrams and the additively weighted power Voronoi diagram, we proposed a new weighted Voronoi diagram, namely the compoundly weighted power Voronoi diagram. These five weighted Voronoi diagrams were efficiently computed with our two-scan algorithm.

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

We developed a two-scan algorithm for discrete Voronoi tessellations of digital images. The computation time of our method is independent of the number of Voronoi sites. In addition to the previous additively, multiplicatively, compoundly weighted Voronoi diagrams and the additively weighted power Voronoi diagram, we proposed a new weighted Voronoi diagram, namely the compoundly weighted power Voronoi diagram. These five weighted Voronoi diagrams were efficiently computed with our two-scan algorithm.

Key concepts: Voronoi diagram, Centroidal Voronoi tessellation, Power diagram, Weighted Voronoi diagram, Computation, Algorithm, Mathematics, Bowyer–Watson algorithm

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Two-Scan Algorithm for Weighted Voronoi Tessellations — Research Paper | ScholarLens