An O(1) time algorithm for the 3D Euclidean distance transform on the CRCW PRAM model

Authors:
Yuh-Rau Wang;Shi-Jinn Horng
Affiliations:
Dept. of Comput. Sci. & Inf. Eng., St John's & St Mary's Inst. of Technol., Taipei, Taiwan;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2003

Citing 0
Cited 7

Efficient Algorithms for the All Nearest Neighbor and Closest Pair Problems on the Linear Array with a Reconfigurable Pipelined Bus System

IEEE Transactions on Parallel and Distributed Systems
Fast All Nearest Neighbor Algorithms from Image Processing Perspective

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
An efficient O(1) time 3D all nearest neighbor algorithm from image processing perspective

Journal of Parallel and Distributed Computing
3D Block-Based Medial Axis Transform and Chessboard Distance Transform on the CREW PRAM

ICA3PP '08 Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing
3D block-based medial axis transform and chessboard distance transform based on dominance

Image and Vision Computing
Parallel re-initialization of level set functions on distributed unstructured tetrahedral grids

Journal of Computational Physics
Constant time algorithms for the 3-d all nearest neighbor problem on the LARPBS

PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies

Quantified Score

Hi-index	0.01

Visualization

Abstract

We develop a parallel algorithm for the 2D Euclidean distance transform (2D_EDT, for short) of a binary image of size N × N in O(1) time using N2+δ+ε CRCW processors and a parallel algorithm for the 3D Euclidean distance transform (3D_EDT, for short) of a binary image of size N × N × N in O(1) time using N3+δ+ε CRCW processors, where δ=1/, ε=1/(2c+1-1), h, and are constants and positive integers. Our 2D_EDT (3D_EDT) parallel algorithm can be used to build up Voronoi diagram and Voronoi polygons (polyhedra) in a 2D (3D) binary image also. All of these parallel algorithms can be performed in O(1) time using N2+δ+ε (N3+δ+ε) CRCW processors. To the best of our knowledge, all results derived above are the best O(1) time algorithms known.