An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images

A Fujiwara, T Masuzawa, H Fujiwara - Information Processing Letters, 1995 - Elsevier
This paper presents a PRAM algorithm for computing the n× n Euclidean distance map. This
algorithm can be performed in O (logn) time using n 2log n processors on the EREW PRAM
and in O (log n log log n) time using n 2 log log n log n processors on the common CRCW
PRAM, respectively. This algorithm is also applicable to many distance maps, for example,
cityblock, chessboard, octagonal and chamfer distance maps.
Showing the best result for this search. See all results