A sequential algorithm for computing the distance map using distances based on neighbourhood sequences (of any length) in the 2D square grid; and 3D cubic, face-centered cubic, and body-centered cubic grids is presented. Conditions for the algorithm to produce correct results are derived using a path-based approach. Previous sequential algorithms for this task have been based on algorithms that compute the digital Euclidean distance transform. It is shown that the latter approach is not well-suited for distances based on neighbourhood sequences. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Strand, R., Nagy, B., Fouard, C., & Borgefors, G. (2006). Generating distance maps with neighbourhood sequences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4245 LNCS, pp. 295–307). Springer Verlag. https://doi.org/10.1007/11907350_25
Mendeley helps you to discover research relevant for your work.