Voronoi tessellation of points with integer coordinates: Time-efficient implementation and online edge-list generation

Authors:
R. L. Ogniewicz;2O. Kübler
Affiliations:
Division of Applied Sciences, Harvard University, Cambridge, MA 02138, U.S.A.;Communication Technology Laboratory, Swiss Federal Institute of Technology ETH, CH-8092 Zurich, Switzerland
Venue:
Pattern Recognition
Year:
1995

Citing 6
Cited 7

A fast voronoi-diagram algorithm with quaternary tree bucketing

Information Processing Letters
Connect-the-dots: a new heuristic

Computer Vision, Graphics, and Image Processing
Algorithms in combinatorial geometry

Algorithms in combinatorial geometry
Extraction of early perceptual structure in dot patterns: integrating region, boundary, and component gestalt

Computer Vision, Graphics, and Image Processing
Continuous skeleton computation by Voronoi diagram

CVGIP: Image Understanding
Dot Pattern Processing Using Voronoi Neighborhoods

IEEE Transactions on Pattern Analysis and Machine Intelligence

Discrete Voronoi Diagrams and the SKIZ Operator: A Dynamic Algorithm

IEEE Transactions on Pattern Analysis and Machine Intelligence
Path-planning by tessellation of obstacles

ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16
A 4-geometry maze router and its application on multiterminal nets

ACM Transactions on Design Automation of Electronic Systems (TODAES)
2D Euclidean distance transform algorithms: A comparative survey

ACM Computing Surveys (CSUR)
An Approach to the Parameterization of Structure for Fast Categorization

International Journal of Computer Vision
A neural architecture for the symmetric-axis transform

Neurocomputing
Efficient Euclidean distance transform algorithm of binary images in arbitrary dimensions

Pattern Recognition

Quantified Score

Hi-index	0.01

Visualization

Abstract

The Voronoi tessellation in the plane can be computed in a particularly time-efficient manner for generators with integer coordinates, such as typically acquired from a raster image. The Voronoi tessellation is constructed line by line during a single scan of the input image, simultaneously generating an edge-list data structure (DCEL) suitable for postprocessing by graph traversal algorithms. In contrast to the generic case, it can be shown that the topology of the grid permits the algorithm to run faster on complex scenes. Consequently, in Computer Vision applications, the computation of the Voronoi tessellation represents an attractive alternative to raster-based techniques in terms of both computational complexity and quality of data structures.