A simple algorithm is given for the computation of the Euclidian distance from the set of black points in an N × N black and white image, for all points in the image. The running time is O(N2 log N) and O(N) extra space is required. The algorithm is suitable for implementation on a parallel machine.
No takes yet. Share an insight, caveat, or question.
Kolountzakis et al. (1992) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: