An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images

DOI10.1016/0020-0190(95)00041-AzbMATH Open0875.68501OpenAlexW2136052880MaRDI QIDQ673013FDOQ673013

Authors: Akihiro Fujiwara, Toshimitsu Masuzawa, Hideo Fujiwara 

Publication date: 28 February 1997

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

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00041-a

Recommendations

• A fast algorithm for Euclidean distance maps of a 2-D binary image
• Fast computation of the Euclidean distance maps for binary images
• A unified linear-time algorithm for computing distance maps

zbMATH Keywords

PRAMImage processingParallel algorithmEuclidean distance map

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Cites Work

• Title not available (Why is that?)
• Faster optimal parallel prefix sums and list ranking
• Fast computation of the Euclidean distance maps for binary images
• A fast algorithm for Euclidean distance maps of a 2-D binary image
• A sublogarithmic convex hull algorithm

Cited In (11)

• Computing the Euclidean distance transform on a linear array of processors
• A cost optimal parallel algorithm for weighted distance transforms.
• Fast computation of the Euclidean distance maps for binary images
• A fast algorithm for Euclidean distance maps of a 2-D binary image
• Dynamics and topological aspects of a reconstructed two-dimensional foam time series using Potts model on a pinned lattice.
• A unified linear-time algorithm for computing distance maps
• Optimal parallel algorithms for proximate points, with applications (extended abstract)
• Parallel computation of the Hausdorff distance between images
• 3-D Voronoi tessellation algorithms
• Finding a minimal cover for binary images: An optimal parallel algorithm
• The equivalence of the chessboard distance transform and the medial axis transform^∗

This page was built for publication: An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images

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