FAST COMPUTATION OF THE EUCLIDEAN DISTANCE MAPS FOR BINARY IMAGES

被引：59

作者：

KOLOUNTZAKIS, MN ^{[1
]}

KUTULAKOS, KN ^{[1
]}

机构：

[1] UNIV WISCONSIN,DEPT COMP SCI,MADISON,WI 53706

来源：

INFORMATION PROCESSING LETTERS | 1992年 / 43卷 / 04期

关键词：

EUCLIDEAN DISTANCE MAP; PARALLEL ALGORITHMS; COMPUTER GRAPHICS; PATTERN RECOGNITION; ROBOTICS; IMAGE PROCESSING;

D O I：

10.1016/0020-0190(92)90197-4

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A simple algorithm is given for the computation of the Euclidian distance from the set of black points in an N x N black and white image, for all points in the image. The running time is O(N2 log N) and O(N) extra space is required. The algorithm is suitable for implementation on a parallel machine.

引用

页码：181 / 184

页数：4