Fast computation of the Euclidean distance maps for binary images
From MaRDI portal
Publication:1199878
DOI10.1016/0020-0190(92)90197-4zbMath0763.68063OpenAlexW2011723506MaRDI QIDQ1199878
Mihail N. Kolountzakis, Kiriakos N. Kutulakos
Publication date: 17 January 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(92)90197-4
Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10)
Related Items (6)
A fast algorithm for Euclidean distance maps of a 2-D binary image ⋮ 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
This page was built for publication: Fast computation of the Euclidean distance maps for binary images
