.png){kind=icon}
.png){kind=icon}
Return
Separable algorithms for distance transformations on irregular grids
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2010.11.010.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this article, we propose to investigate two extensions of the (EDT)-D-2 (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. (C) 2010 Elsevier B.V. All rights reserved.
Keywords:
Squared Euclidean distance transformation
Irregular grids
Quadtree
Voronoi diagrams
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.3
Papers:
7.9K
Citations:
1.6W