TWO ALGORITHMS FOR COMPUTING THE EUCLIDEAN DISTANCE TRANSFORM

Abstract

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.