Skip to Main content Skip to Navigation
Journal articles

Separable algorithms for distance transformations on irregular grids

Antoine Vacavant 1 David Coeurjolly 1 Laure Tougne 1 
1 M2DisCo - Geometry Processing and Constrained Optimization
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : In this article, we propose to investigate two extensions of the E2DT (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.
Document type :
Journal articles
Complete list of metadata
Contributor : Équipe gestionnaire des publications SI LIRIS Connect in order to contact the contributor
Submitted on : Thursday, August 18, 2016 - 7:24:39 PM
Last modification on : Tuesday, June 1, 2021 - 2:08:07 PM


  • HAL Id : hal-01354375, version 1


Antoine Vacavant, David Coeurjolly, Laure Tougne. Separable algorithms for distance transformations on irregular grids. Pattern Recognition Letters, Elsevier, 2011, 9, 32, pp.1356-1364. ⟨hal-01354375⟩



Record views