Cart (Loading....) | Create Account
Close category search window
 

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yuh-Rau Wang ; Dept. of Comput. Sci. & Inf. Eng., St John''s & St Mary''s Inst. of Technol., Taipei, Taiwan ; Shi-Jinn Horng

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.

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:14 ,  Issue: 10 )

Date of Publication:

Oct. 2003

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.