Generating Distance Maps with Neighbourhood Sequences

DOI10.1007/11907350_25MaRDI QIDQ5386031zbMATH OpenOpenAlexFDO

Authors Robin Strand, Benedek Nagy, Céline Fouard, Gunilla Borgefors

Publication date 17 April 2008

Published in Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11907350_25

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Distances based on neighbourhood sequences in non-standard three-dimensional grids
• Path-based distance with varying weights and neighborhood sequences
• scientific article; zbMATH DE number 2099143
• Neighborhood sequences in the diamond grid -- algorithms with four neighbors
• Neighborhood sequences on \(n\)D hexagonal/face-centered-cubic grids

Cited in

(6)

• Path-based distance with varying weights and neighborhood sequences
• Distance transform computation for digital distance functions
• Neighborhoods for distance transformations using ordered propagation
• Distances based on neighbourhood sequences in non-standard three-dimensional grids
• Distance with generalized neighbourhood sequences in n D and D
• Neighborhood sequences in the diamond grid -- algorithms with four neighbors

This page was built for publication: Generating Distance Maps with Neighbourhood Sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5386031)