A unified linear-time algorithm for computing distance maps

DOI10.1016/0020-0190(96)00049-XMaRDI QIDQ1350616zbMATH OpenOpenAlexFDO

Authors 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

algorithmsimage processingcomputer visionEuclidean distance transformmatrix searching

Mathematics Subject Classification ID

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

Recommendations

• Fast computation of the Euclidean distance maps for binary images
• An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images
• A fast algorithm for Euclidean distance maps of a 2-D binary image

Cites work

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

Cited in

(19)

• Linear time distance transforms for quadtrees
• Finding a minimum medial axis of a discrete shape is NP-hard
• Parallel computation of distance transforms
• Appearance Radii in Medial Axis Test Mask for Small Planar Chamfer Norms
• A general algorithm for computing distance transforms in linear time
• Measuring the distance of generalized maps
• scientific article; zbMATH DE number 5262894 (Why is no real title available?)
• scientific article; zbMATH DE number 1958101 (Why is no real title available?)
• The Boolean map distance: theory and efficient computation
• Exact Linear Time Euclidean Distance Transforms of Grid Line Sampled Shapes
• Some theoretical challenges in digital geometry: a perspective
• A linear-time algorithm for Euclidean feature transform sets
• Separable distance transformation and its applications
• Linear time algorithms for exact distance transform
• 3-D Voronoi tessellation algorithms
• Morphological decomposition and compression of binary images via a minimum set cover algorithm
• Visible vectors and discrete Euclidean medial axis
• Fast computation of the Euclidean distance maps for binary images
• A discrete bisector function based on annulus

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

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