On computing the exact Euclidean distance transform on rectangular and hexagonal grids
From MaRDI portal
Publication:1969583
DOI10.1023/A:1008352402867zbMath0941.68780OpenAlexW1544192755MaRDI QIDQ1969583
Andrew J. H. Mehnert, Paul T. Jackway
Publication date: 10 July 2000
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008352402867
Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (4)
Linear time algorithms for exact distance transform ⋮ Fast distance transformation on irregular two-dimensional grids ⋮ The discrete degree of metric spaces and the Lipschitz-continuity of distance transforms ⋮ Almost regular metrics on groups and Lipschitz-continuity of distance transforms
This page was built for publication: On computing the exact Euclidean distance transform on rectangular and hexagonal grids
