Finding local maxima in a pseudo-Euclidean distance transform
Computer Vision, Graphics, and Image Processing
An Efficient Uniform Cost Algorithm Applied to Distance Transforms
IEEE Transactions on Pattern Analysis and Machine Intelligence
Continuous skeleton computation by Voronoi diagram
CVGIP: Image Understanding
Approximation of generalized Voronoi diagrams by ordinary Voronoi diagrams
CVGIP: Graphical Models and Image Processing
Skeletonization via distance maps and level sets
Computer Vision and Image Understanding
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)
A Parallel Thinning Algorithm with Two-Subiteration that Generates One-Pixel-Wide Skeletons
ICPR '96 Proceedings of the International Conference on Pattern Recognition (ICPR '96) Volume IV-Volume 7472 - Volume 7472
Hi-index | 0.01 |
This paper proposes a method for computing the medial axis transform (MAT) or the skeleton of a general 2D shape using a technique with a high performance, based on a distance transform computation from the shape's boundaries. The distance transform is computed propagating a wavefront from the boundary, and the skeleton is obtained detecting the points where the wavefronts collide themselves, and applying connectivity rules during the process. This method has two main advantages: the efficiency and the preservation of the skeleton properties.