Computational geometry: an introduction
Computational geometry: an introduction
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Distance transforms: properties and machine vision applications
CVGIP: Graphical Models and Image Processing
Some Sequential Algorithms for a Generalized Distance Transformation Based on Minkowski Operations
IEEE Transactions on Pattern Analysis and Machine Intelligence
Improved incremental randomized Delaunay triangulation
Proceedings of the fourteenth annual symposium on Computational geometry
A List-Processing Approach to Compute Voronoi Diagrams and the Euclidean Distance Transform
IEEE Transactions on Pattern Analysis and Machine Intelligence
Sequential Operations in Digital Picture Processing
Journal of the ACM (JACM)
Multidimensional binary search trees used for associative searching
Communications of the ACM
Linear Time Euclidean Distance Algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Weighted distance transforms for volume images digitized in elongated voxel grids
Pattern Recognition Letters - Special issue: Discrete geometry for computer imagery (DGCI'2002)
Fast Exact Euclidean Distance (FEED) Transformation
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 3 - Volume 03
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
3-D chamfer distances and norms in anisotropic grids
Image and Vision Computing
Supercover model and digital straight line recognition on irregular isothetic grids
DGCI'05 Proceedings of the 12th 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
Separable algorithms for distance transformations on irregular grids
Pattern Recognition Letters
| Hi-index | 0.00 |
In this article, we propose to investigate the extension of the E2DT (squared Euclidean Distance Transformation) on irregular isothetic grids. We give two algorithms to handle different structurations of grids. We first describe a simple approach based on the complete Voronoi diagram of the background irregular cells. Naturally, this is a fast approach on sparse and chaotic grids. Then, we extend the separable algorithm defined on square regular grids proposed in [22], more convenient for dense grids. Those two methodologies permit to process efficiently E2DT on every irregular isothetic grids.