TWO ALGORITHMS FOR COMPUTING THE EUCLIDEAN DISTANCE TRANSFORM

Gavrilova, MarinaAlsuwaiyel, Muhammad H.2008-02-262008-02-262000-06-20http://hdl.handle.net/1880/45485Given 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.EngComputer ScienceTWO ALGORITHMS FOR COMPUTING THE EUCLIDEAN DISTANCE TRANSFORMunknown2000-661-1310.11575/PRISM/30621