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

DOI10.1016/0020-0190(95)00041-AzbMath0875.68501OpenAlexW2136052880MaRDI QIDQ673013

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

zbMATH Keywords

PRAMImage processingParallel algorithmEuclidean distance map

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items (5)

A unified linear-time algorithm for computing distance maps ⋮ 3-D Voronoi tessellation algorithms ⋮ Optimal parallel algorithms for proximate points, with applications ⋮ Dynamics and topological aspects of a reconstructed two-dimensional foam time series using Potts model on a pinned lattice. ⋮ The equivalence of the chessboard distance transform and the medial axis transform^∗

Cites Work

• Unnamed Item
• A sublogarithmic convex hull algorithm
• Fast computation of the Euclidean distance maps for binary images
• A fast algorithm for Euclidean distance maps of a 2-D binary image
• Faster optimal parallel prefix sums and list ranking

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