A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
We propose a new signed or unsigned Euclidean distance transformation algorithm, based on the local corrections of the well-known 4SED algorithm of Danielsson. Those corrections are only applied to a small neighborhood of a small subset of pixels from the image, which keeps the cost of the operation low. In contrast with all fast algorithms previously published, our algorithm produces perfect Euclidean distance maps in a time linearly proportional to the number of pixels in the image. Thedoi:10.1109/icassp.1999.757545 dblp:conf/icassp/CuisenaireM99 fatcat:qspn6irlzrcrzlddv6uminvnrq