A unified linear-time algorithm for computing distance maps

DOI10.1016/0020-0190(96)00049-XzbMath1023.68681OpenAlexW2009427280MaRDI QIDQ1350616

Tomio Hirata

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00049-x

zbMATH Keywords

algorithmscomputer visionimage processingEuclidean distance transformmatrix searching

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Machine vision and scene understanding (68T45)

Related Items (10)

A linear-time algorithm for Euclidean feature transform sets ⋮ 3-D Voronoi tessellation algorithms ⋮ Exact Linear Time Euclidean Distance Transforms of Grid Line Sampled Shapes ⋮ Morphological decomposition and compression of binary images via a minimum set cover algorithm ⋮ Finding a minimum medial axis of a discrete shape is NP-hard ⋮ Separable Distance Transformation and Its Applications ⋮ Some theoretical challenges in digital geometry: a perspective ⋮ Appearance Radii in Medial Axis Test Mask for Small Planar Chamfer Norms ⋮ A Discrete Bisector Function Based on Annulus ⋮ Visible vectors and discrete Euclidean medial axis

Cites Work

• An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images
• Geometric applications of a matrix-searching algorithm
• Fast computation of the Euclidean distance maps for binary images
• A fast algorithm for Euclidean distance maps of a 2-D binary image
• Sequential Operations in Digital Picture Processing

This page was built for publication: A unified linear-time algorithm for computing distance maps