A distance transformation converts a digital binary image that consists of object (foreground) and non-object (background) pixels into a gray-scale image in which each object pixel has a value corresponding to the minimum distance from the background by a distance function. Due to its nonlinearity, the global operation of Euclidean distance transformation (EDT) is difficult to decompose into small neighborhood operations. Two efficient algorithms on EDT are presented, using integers of squared Euclidean distances in which the global computations can be equivalent to local 3/spl times/3 neighborhood operations. The first algorithm requires only a limited number of iterations on the chain propagation. The second algorithm can avoid iterations, and simply requires two scans of the image. The complexity of both algorithms is only linearly proportional to image size.>