COMPUTING SOME DISTANCE FUNCTIONS BETWEEN POLYGONS

被引：15
作者：
ATALLAH, MJ [1 ]
RIBEIRO, CC [1 ]
LIFSCHITZ, S [1 ]
机构：
[1] UNIV RIO JANEIRO,DEPT ELECT ENGN,CAIXA POSTAL 38063,GAVEA 22452,RJ,BRAZIL
来源：
PATTERN RECOGNITION | 1991年 / 24卷 / 08期
基金：
美国国家科学基金会;
关键词：
COMPUTATIONAL GEOMETRY; POLYGONS; DISTANCE COMPUTATION; HAUSDORFF DISTANCE; PATTERN RECOGNITION; CONTOUR FITTING; ROBOT VISION; ALGORITHMS;
D O I：
10.1016/0031-3203(91)90045-7
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We present algorithms for computing some distance functions between two (possibly intersecting) polygons, in both the convex and nonconvex cases. The interest for such distance functions comes from applications in robot vision, pattern recognition and contour fitting. We present an optimal EREW-PRAM parallel algorithm for the case when the input polygons are convex, and an essentially quadratic sequential algorithm for the case of arbitrary polygons (possibly with holes).
引用
收藏
页码：775 / 781
页数：7
相关论文
共 18 条
12