loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)
An O(1) Time Parallel Algorithm for the Dominance Counting and 3D Block-Based Medial Axis Transform on AROB
Dalian, China
December 05-December 08
ISBN: 0-7695-2405-2
Shih-Ying Lin, Lan Yang Institute of Technology, I-Lan, Taiwan.
Shi-Jinn Horng, National Taiwan University of Science and Technology, Taipei, Taiwan.
Tzong-Wann Kao, Northern Taiwan Institute of Science and Technology, Taipei, Taiwan
Yuh-Rau Wang, St. John?s and St. Mary?s University of Technology, Taipei, Taiwan.
In this paper, we present a constant time algorithm for solving three dimensional block-based medial axis transform (3D BB-MAT, for short) on the array with reconfigurable optical buses (AROB). The main contribution of this work is to exploit the dominance counting method for solving the 3D BB-MAT that was never done previously in the literature. With the advantages of both optical transmission and electronic computation on the AROB model, the constant algorithm is proposed for the medial axis transform of a 3D N x N x N binary image on a 4D AROB using N^4 processors. To the best of our knowledge, this presented result of the dominance counting technique for medial axis transform of block-based is the best O(1) time algorithm known.
Citation:
Shih-Ying Lin, Shi-Jinn Horng, Tzong-Wann Kao, Yuh-Rau Wang, "An O(1) Time Parallel Algorithm for the Dominance Counting and 3D Block-Based Medial Axis Transform on AROB," pdcat, pp.603-609, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.