An efficient algorithm for complete Euclidean distance transform on mesh-connected SIMD

DOI10.1016/0167-8191(94)00103-HMaRDI QIDQ673537zbMATH OpenOpenAlexFDO

Authors Ling Chen, Henry Y. H. Chuang

Publication date 28 February 1997

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(94)00103-h

zbMATH Keywords

Complexity analysisEuclidean distance transformImage analysisMesh-connected SIMD computer

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

Recommendations

• A fast algorithm for Euclidean distance maps of a 2-D binary image
• Constant-time algorithm for the Euclidean distance transform on reconfigurable meshes.
• Computing the Euclidean distance transform on a linear array of processors
• Parallel computation of exact Euclidean distance transform

Cited in

(6)

• Parallel computation of exact Euclidean distance transform
• Computing the Euclidean distance transform on a linear array of processors
• SIMD
• Fast and scalable algorithms for the Euclidean distance transform on a linear array with a reconfigurable pipelined bus system
• 3-D Voronoi tessellation algorithms
• Constant-time algorithm for the Euclidean distance transform on reconfigurable meshes.

This page was built for publication: An efficient algorithm for complete Euclidean distance transform on mesh-connected SIMD

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