Generating Distance Maps with Neighbourhood Sequences
2006 (English)In: Discrete Geometry for Computer Imagery: 13th International Conference, DGCI 2006, Szeged, Hungary, October 25-27, 2006. Proceedings / [ed] Attila Kuba, László G. Nyúl and Kálmán Palágyi, Berlin, Heidelberg: Springer , 2006, 295-307 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
Berlin, Heidelberg: Springer , 2006. 295-307 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 4245
IdentifiersURN: urn:nbn:se:uu:diva-21840DOI: 10.1007/11907350_25OAI: oai:DiVA.org:uu-21840DiVA: diva2:49613