Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of spatial data structures: Computer graphics, image processing, and GIS
Distance transforms: properties and machine vision applications
CVGIP: Graphical Models and Image Processing
A unified linear-time algorithm for computing distance maps
Information Processing Letters
Linear Time Euclidean Distance Algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Digital Geometry: Geometric Methods for Digital Picture Analysis
Digital Geometry: Geometric Methods for Digital Picture Analysis
Weighted distance transforms for volume images digitized in elongated voxel grids
Pattern Recognition Letters - Special issue: Discrete geometry for computer imagery (DGCI'2002)
A Skeletonization Algorithm Using Chamfer Distance Transformation Adapted to Rectangular Grids
ICPR '96 Proceedings of the 13th International Conference on Pattern Recognition - Volume 2
IEEE Transactions on Pattern Analysis and Machine Intelligence
2D Euclidean distance transform algorithms: A comparative survey
ACM Computing Surveys (CSUR)
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
3-D chamfer distances and norms in anisotropic grids
Image and Vision Computing
Distance transformation on two-dimensional irregular isothetic grids
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
A novel algorithm for distance transformation on irregular isothetic grids
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Fast distance transformation on irregular two-dimensional grids
Pattern Recognition
The delaunay triangulation by grid subdivision
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
| Hi-index | 0.10 |
In this article, we propose to investigate two extensions of the E^2DT (squared Euclidean Distance Transformation) on irregular isothetic grids (or I-grids), such as quadtree/octree or run-length encoded d-dimensional images. We enumerate the advantages and drawbacks of the I-CDT, based on the cell centres, and the ones of the I-BDT, which uses the cell borders. One of the main problem we mention is that no efficient algorithm has been designed to compute both transforms in arbitrary dimensions. To tackle this problem, we describe in this paper two algorithms, separable in dimension, to compute these distance transformations in the two-dimensional case, and we show that they can be easily extended to higher dimensions.