I am looking for the fastest available algorithm for distance transform.
According to this site http://homepages.inf.ed.ac.uk/rbf/HIPR2/distance.htm, it describes: “The distance transform can be calculated much more efficiently using clever algorithms in only two passes (e.g. Rosenfeld and Pfaltz 1968).”
Searching around, I found: “Rosenfeld, A and Pfaltz, J L. 1968. Distance Functions on Digital Pictures. Pattern Recognition, 1, 33-61.”
But I believe we should have a better and faster algorithm than the one in 1968 already? In fact, I could not find the source from 1968, so any help is highly appreciated.
There’s tons of newer work on computing distance functions.
By the way, you’d really want to use these instead of the work by Rosenfeld, specifically when you want to compute distances in the presence of obstacles.