Voronoi tessellation and Delauney triangulation using Euclidean disk growing in Z2

Authors:
C. Kotropoulos;I. Pitas;A. Maglara
Affiliations:
Department of Electrical Engineering, University of Thessaloniki, Thessaloniki, Greece;Department of Electrical Engineering, University of Thessaloniki, Thessaloniki, Greece;Department of Electrical Engineering, University of Thessaloniki, Thessaloniki, Greece
Venue:
ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: image and multidimensional signal processing - Volume V
Year:
1993

Citing 10
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
Distance transformations in digital images

Computer Vision, Graphics, and Image Processing
A note on “distance transformations in digital images"

Computer Vision, Graphics, and Image Processing
A note on “distance transformations in arbitrary dimensions"

Computer Vision, Graphics, and Image Processing
A comment on “a note on `distance transformations in digital images”'

Computer Vision, Graphics, and Image Processing
A One-Pass Two-Operation Process to Detect the Skeletal Pixels on the 4-Distance Transform

IEEE Transactions on Pattern Analysis and Machine Intelligence
An Efficient Uniform Cost Algorithm Applied to Distance Transforms

IEEE Transactions on Pattern Analysis and Machine Intelligence
Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations

IEEE Transactions on Pattern Analysis and Machine Intelligence
Analysis and implementation of morphological skeleton transforms

Circuits, Systems, and Signal Processing - Special issue: median and morphological filters
Image Analysis and Mathematical Morphology

Image Analysis and Mathematical Morphology

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new approximation of Euclidean distance in Z2 is proposed and a novel algorithm for the computation of Voronoi tessellation and Delauney triangulation is presented based on the above-mentioned approximation of Euclidean distance. The proposed method has low computational complexity (of order O(1/N)) and allows parallel implementation. Mathematical Morphology is used to implement the Voronoi tessellation and the Delauney triangulation.