In-place linear-time algorithms for Euclidean distance transform

DOI10.1007/978-3-642-16236-7_7MaRDI QIDQ3052776zbMATH OpenOpenAlexFDO

Authors Hiroshi Tanaka, Tetsuo Asano

Publication date 2 November 2010

Published in Transactions on Computational Science VIII (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-16236-7_7

Mathematics Subject Classification ID

Affine analytic geometry (51N10) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Recommendations

• A linear-time algorithm for Euclidean feature transform sets
• Efficient Computation of the Euclidean Distance Transform
• A linear time algorithm for computing the Euclidean distance transform in arbitrary dimensions
• Combinatorial Image Analysis
• A general algorithm for computing distance transforms in linear time

Cited in

(12)

• Computing the Euclidean distance transform on a linear array of processors
• Fast and scalable algorithms for the Euclidean distance transform on a linear array with a reconfigurable pipelined bus system
• Linear time algorithms for exact distance transform
• A general algorithm for computing distance transforms in linear time
• A linear time algorithm for computing the Euclidean distance transform in arbitrary dimensions
• Distance transforms of sampled functions
• Exact Linear Time Euclidean Distance Transforms of Grid Line Sampled Shapes
• Linear time distance transforms for quadtrees
• Efficient Euclidean distance transform algorithm of binary images in arbitrary dimensions
• Efficient Computation of the Euclidean Distance Transform
• Combinatorial Image Analysis
• A linear-time algorithm for Euclidean feature transform sets

This page was built for publication: In-place linear-time algorithms for Euclidean distance transform

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