作者: Robin Strand , Benedek Nagy , Céline Fouard , Gunilla Borgefors
DOI: 10.1007/11907350_25
关键词:
摘要: A sequential algorithm for computing the distance map using distances based on neighbourhood sequences (of any length) in 2D square grid; and 3D cubic, face-centered body-centered cubic grids is presented Conditions to produce correct results are derived a path-based approach Previous algorithms this task have been that compute digital Euclidean transform It shown latter not well-suited sequences.