Skip Navigation

The Computer Journal 2000 43(4):315-324; doi:10.1093/comjnl/43.4.315
© 2000 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Chung, K.-L.
Right arrow Articles by Chen, H.-N.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A Neighbor-finding Algorithm for Bincode-based Images on Reconfigurable Meshes

Kuo-Liang Chung1,3 and Hsiu-Niang Chen2

1 Department of Information Management, Institute of Computer Science and Information Engineering, National Taiwan University of Science and Technology, 43, Section 4, Keelung Road, Taipei, Taiwan 10672, Republic of China Email: klchung@cs.ntust.edu.tw 2 Department of Information Management, Van-Nung Institute of Technology, 63-1, Shuiwei, Chungli, Taoyuan, Taiwan 320, Republic of China 3 Author to whom correspondence should be addressed

Using bincodes to represent binary images is a storage-saving encoding scheme. Finding neighbors is one of the most important operations in spatial data structures. This paper presents an efficient parallel algorithm for solving the problem of neighbor-finding for a bincode-based binary image. Given a set of the bincodes of n blocks, the neighbor-finding algorithm can be accomplished in O(1)-time on an n1/2 x n1/2 x n1/2 reconfigurable mesh. Under the same time bound, i.e. constant time, the number of processors used in the proposed parallel algorithm is O(n3/2) and is less than that of the previous fastest one on a mesh with multiple broadcasting buses [1] which needs O(n2) processors.

Received 17 June, 1998. Revised 0 December, 1999.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.