.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Squared Euclidean distance transformation
Irregular grids
Quadtree
Voronoi diagrams
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
7.9K
被引数:
1.6W
机构
引用论文
Fast distance transformation on irregular two-dimensional grids不规则二维网格上的快速距离变换.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏
分享收藏
查看更多内容