Generating Distance Maps with Neighbourhood Sequences

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.

• Type: Conference
• Year: 2006
• Where: DGCI
• Authors: Robin Strand, Benedek Nagy, Céline Fouard, Gunilla Borgefors
• Keywords: Body-centered Cubic Grids, DGCI 2006, Discrete Geometry, Neighbourhood Sequences, Sequential Algorithms