A fast algorithm for Euclidean distance maps of a 2-D binary image

DOI10.1016/0020-0190(94)00062-XzbMath0807.68105MaRDI QIDQ1328760

Ling Chen, Henry Y. H. Chuang

Publication date: 3 August 1994

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

pattern recognitioncomputer visionroboticsEuclidean distance map

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10) Distributed algorithms (68W15)

Related Items (6)

A linear-time algorithm for Euclidean feature transform sets ⋮ A unified linear-time algorithm for computing distance maps ⋮ 3-D Voronoi tessellation algorithms ⋮ Dynamics and topological aspects of a reconstructed two-dimensional foam time series using Potts model on a pinned lattice. ⋮ An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images ⋮ The equivalence of the chessboard distance transform and the medial axis transform^∗

Cites Work

• Fast computation of the Euclidean distance maps for binary images

This page was built for publication: A fast algorithm for Euclidean distance maps of a 2-D binary image