Finding local maxima in a pseudo-Euclidean distance transform
Computer Vision, Graphics, and Image Processing
A unified linear-time algorithm for computing distance maps
Information Processing Letters
Computer representation of planar regions by their skeletons
Communications of the ACM
Medial axis for chamfer distances: computing look-up tables and neighbuorhoods in 2D or 3D
Pattern Recognition Letters
IEEE Transactions on Pattern Analysis and Machine Intelligence
Finding a minimum medial axis of a discrete shape is NP-hard
Theoretical Computer Science
Discrete 2D and 3D euclidean medial axis in higher resolution
Image and Vision Computing
Medial axis lookup table and test neighborhood computation for 3D chamfer norms
Pattern Recognition
Visible Vectors and Discrete Euclidean Medial Axis
Discrete & Computational Geometry
Exact medial axis with euclidean distance
Image and Vision Computing
Medial axis LUT computation for chamfer norms using H-polytopes
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Farey Sequences and the Planar Euclidean Medial Axis Test Mask
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
| Hi-index | 0.00 |
The test mask TM is the minimum neighbourhood sufficient to extract the medial axis of any discrete shape, for a given chamfer distance mask M. We propose an arithmetical framework to study TM in the case of chamfer norms. We characterize TM for 3×3 and 5×5 chamfer norm masks, and we give an algorithm to compute the appearance radius of the vector (2, 1) in TM.