By Topic

Efficient parallel sibling finding for quadtree data structure

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)
Doctor, D.P. ; Dept of Comput. Sci., Texas Univ., Dallas, Richardson, TX, USA ; Sudborough, I.H.

This paper presents efficient parallel (hypercube and EREW-PRAM) algorithms for building pointer-based and linear quadtrees from boundary/chain code image representation. For the input boundary code of length O(b) and the height O(h) of the output quadtree, over EREW-PRAM algorithm takes O(h + logb) time and O(b) processors for quadtree building from boundary code; this improves upon a previously published CREW-PRAM algorithm requiring O(h * logb) time and O(b) processors; which also improves upon a previously published hypercube algorithm requiring O(logb(h + log2logb)) time and O(b) processors. The algorithms, presented here, use a direct and simple sibling finding technique for quadtrees; our technique exploits regularity in quadtree data structure, and it is applicable to any k-ary tree for which some (arbitrary) ordering exists among child nodes of a parent node

Published in:

Parallel and Distributed Processing, 1993. Proceedings of the Fifth IEEE Symposium on

Date of Conference:

1-4 Dec 1993