Finding local maxima in a pseudo-Euclidean distance transform
Computer Vision, Graphics, and Image Processing
Local distances for distance transformations in two and three dimensions
Pattern Recognition Letters
Sequential Operations in Digital Picture Processing
Journal of the ACM (JACM)
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
Digital distance transforms in 3D images using information from neighbourhoods up to 5 × 5 × 5
Computer Vision and Image Understanding
Weighted digital distance transforms in four dimensions
Discrete Applied Mathematics
IEEE Transactions on Pattern Analysis and Machine Intelligence
Weighted distances based on neighbourhood sequences
Pattern Recognition Letters
Medial axis lookup table and test neighborhood computation for 3D chamfer norms
Pattern Recognition
Farey Sequences and the Planar Euclidean Medial Axis Test Mask
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Appearance radii in medial axis test mask for small planar chamfer norms
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Sparse object representations by digital distance functions
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Hi-index | 0.00 |
Chamfer distances are discrete distances based on the propagation of local distances, or weights defined in a mask. The medial axis, i.e. the centers of the maximal disks (disks which are not contained in any other disk), is a powerful tool for shape representation and analysis. The extraction of maximal disks is performed in the general case with comparison tests involving look-up tables representing the covering relation of disks in a local neighborhood. Although look-up table values can be computed efficiently [1], the computation of the look-up table neighborhood tend to be very time-consuming. By using polytope [2] descriptions of the chamfer disks, the necessary operations to extract the look-up tables are greatly reduced.