Efficient Euclidean distance transform algorithm of binary images in arbitrary dimensions

DOI10.1016/J.PATCOG.2012.07.030MaRDI QIDQ456033zbMATH OpenOpenAlexFDO

Authors Ying Tan, Jun Wang

Publication date 23 October 2012

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.patcog.2012.07.030

zbMATH Keywords

linear time algorithmarbitrary dimensionsbinary imageEuclidean distance transformindependent scan

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)

Recommendations

• A linear time algorithm for computing the Euclidean distance transform in arbitrary dimensions
• Efficient Computation of the Euclidean Distance Transform
• A linear-time algorithm for Euclidean feature transform sets
• The Euclidean distance transform in arbitrary dimensions
• In-place linear-time algorithms for Euclidean distance transform

Cited in

(7)

• A fast algorithm for Euclidean distance maps of a 2-D binary image
• Anti-aliased Euclidean distance transform on 3D sampling lattices
• A linear-time algorithm for Euclidean feature transform sets
• Efficient Computation of the Euclidean Distance Transform
• On the role of distance transformations in Baddeley's delta metric
• The Euclidean distance transform in arbitrary dimensions
• A linear time algorithm for computing the Euclidean distance transform in arbitrary dimensions

This page was built for publication: Efficient Euclidean distance transform algorithm of binary images in arbitrary dimensions

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