Corrigendum to “Efficient Computation of the Euclidean Distance Transform”
作者:
Highlights:
•
摘要
An algorithm for the distance transform of a binary image was presented in L. Boxer and R. Miller (Comput. Vision Image Understand.80, 2000, 379–383). The algorithm was stated for the Euclidean metric. In this Corrigendum, we show that the algorithm of Boxer and Miller (2000) is correct for the L1 “Manhattan” or “city block” metric; however, the algorithm is not correct for the general class of Lp metrics, including the Enclidean metric.
论文关键词:distance transform,binary image,parallel algorithm,RAM,EREW PRAM,mesh,hypercube,mesh-of-trees
论文评审过程:Received 7 February 2002, Accepted 19 June 2002, Available online 21 November 2002.
论文官网地址:https://doi.org/10.1006/cviu.2002.0968