Distance transformations in digital images
Computer Vision, Graphics, and Image Processing
Euclidean distance transformations amd model-guided image interpretation
Pattern Recognition Letters
Distance transforms: properties and machine vision applications
CVGIP: Graphical Models and Image Processing
A fast algorithm for Euclidean distance maps of a 2-D binary image
Information Processing Letters
A unified linear-time algorithm for computing distance maps
Information Processing Letters
Digital Picture Processing
Linear Time Euclidean Distance Algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computing the Euclidean Distance Transform on a Linear Array of Processors
The Journal of Supercomputing
Multi-Pass Geometric Algorithms
Discrete & Computational Geometry
2D Euclidean distance transform algorithms: A comparative survey
ACM Computing Surveys (CSUR)
Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array?
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Space-Efficient Algorithm for Image Rotation
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Constant-Working-Space Algorithms for Image Processing
Emerging Trends in Visual Computing
| Hi-index | 0.00 |
Given a binary image, Euclidean distance transform is to compute for each pixel the Euclidean distance to the closest black pixel. This paper presents a linear-time algorithm for Euclidean distance transform without using any extra array. This is an improvement over a known algorithm which uses additional arrays as work storage. An idea to reduce the work space is to utilize the output array as work storage. Implementation results and comparisons with existing algorithms are also included.