Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
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)
IEEE Transactions on Pattern Analysis and Machine Intelligence
2D Euclidean distance transform algorithms: A comparative survey
ACM Computing Surveys (CSUR)
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
The delaunay triangulation by grid subdivision
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
Fast distance transformation on irregular two-dimensional grids
Pattern Recognition
Separable algorithms for distance transformations on irregular grids
Pattern Recognition Letters
| Hi-index | 0.00 |
In this article, we propose a new definition of the E2DT (Squared Euclidean Distance Transformation) on irregular isothetic grids such as quadtree/octree or run-length encoded d-dimensional images. We describe a new separable algorithm to compute this transformation on every grids, which is independent of the background representation. We show that our proposal is able to efficiently handle various kind of classical irregular two-dimensional grids in imagery, and that it can be easily extended to higher dimensions.