TWO ALGORITHMS FOR COMPUTING THE EUCLIDEAN DISTANCE TRANSFORM

Given an n x n binary image of white and black pixels, we present two algorithms for computing the distance transform and the nearest feature transform using the Euclidean metric. The first algorithm is a fast sequentioal O (n) time algorithm. The second is an optimal O (n) time parallel algorithm that runs on a linear array of n processors.We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at [email protected]