NEIGHBORHOODS FOR DISTANCE TRANSFORMATIONS USING ORDERED PROPAGATION

This paper presents a fast method for creating distance maps using ordered propagation techniques, where only the propagation front is processed in any stage of the operation. In this paper, we place the emphasis on the size of the neighborhoods used, the number of pixels that must be inspected for each pixel that is processed. We have developed algorithms for both non-Euclidean and Euclidean metrics where only two neighbors need to be inspected per pixel. For Euclidean distance maps, a version that is totally error-free is proposed. © 1992.