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

Multiple Storage Quad Trees: A Simpler Faster Alternative to Bisector List Quad Trees

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

1 Author(s)
Brown, R.L. ; Department of Electrical Engineering, College of Engineering, University of Arkansas, AR, USA

A bisector list quad tree is a quad tree which stores objects intersecting more than one quad on horizontal and vertical bisector lists. This is the form of quad tree originally proposed by Kedem for organizing boxes and polygons in a plane so that one can quickly find the objects intersecting an arbitrary window. A multiple storage quad tree is a quad tree which stores pointers to objects intersecting more than one quad in all of the quads that they intersect. This paper describes and analyzes multiple storage quad trees. It is shown that multiple storage quad trees can be efficient in storage space, often using less than 25 percent more space than a simple list of the objects. That is, the tree nodes and other pointers combined often use less than 25 percent of the space needed to store the object descriptions. It is also shown that using multiple-storage quad trees makes possible very rapid searches for the objects intersecting a small window. In most cases fewer than 10 nodes must be examined per object found in the window. Finally, multiple storage quad trees and the algorithms which operate on them are found to be very simple and intuitive.

Published in:

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on  (Volume:5 ,  Issue: 3 )

Date of Publication:

July 1986

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.