A List-Processing Approach to Compute Voronoi Diagrams and the Euclidean Distance Transform

Authors:
Weiguang Guan;Songde Ma
Affiliations:
Victoria Univ. of Wellington;Chinese Academy of Sciences, China
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1998

Citing 6
Cited 10

An Efficient Uniform Cost Algorithm Applied to Distance Transforms

IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Homotopy-Preserving Skeletons Using Mathematical Morphology

IEEE Transactions on Pattern Analysis and Machine Intelligence
Sequential Operations in Digital Picture Processing

Journal of the ACM (JACM)
A Method for Obtaining Skeletons Using a Quasi-Euclidean Distance

Journal of the ACM (JACM)
Shape-Based Interpolation

IEEE Computer Graphics and Applications
Linear Time Euclidean Distance Algorithms

IEEE Transactions on Pattern Analysis and Machine Intelligence

A Linear Time Algorithm for Computing Exact Euclidean Distance Transforms of Binary Images in Arbitrary Dimensions

IEEE Transactions on Pattern Analysis and Machine Intelligence
Computing the Euclidean Distance Transform on a Linear Array of Processors

The Journal of Supercomputing
The "Dead reckoning" signed distance transform

Computer Vision and Image Understanding
Optimal Separable Algorithms to Compute the Reverse Euclidean Distance Transformation and Discrete Medial Axis in Arbitrary Dimension

IEEE Transactions on Pattern Analysis and Machine Intelligence
2D Euclidean distance transform algorithms: A comparative survey

ACM Computing Surveys (CSUR)
Distance transformation on two-dimensional irregular isothetic grids

DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
An efficient euclidean distance transform

IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
Euclidean distance transform of digital images in arbitrary dimensions

PCM'06 Proceedings of the 7th Pacific Rim conference on Advances in Multimedia Information Processing
The euclidean distance transform applied to the FCC and BCC grids

IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part I
Efficient Euclidean distance transform algorithm of binary images in arbitrary dimensions

Pattern Recognition

Quantified Score

Hi-index	0.14

Visualization

Abstract

In this paper, we propose an efficient Voronoi transform algorithm for constructing Voronoi diagrams using segment lists of rows. A significant feature of the algorithm is that it takes segments rather than pixels as the basic units to represent and propagate the nearest neighbor information. The segment lists are dynamically updated as they are scanned. A distance map can then be easily computed from the segment list representation of the Voronoi diagram. Experimental results have demonstrated its high efficiency. Extension of the algorithm to higher dimensions is also discussed.