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

Quadtree traversal algorithms for pointer-based and depth-first representations

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)
Fuhrmann, D.R. ; Washington Univ., St. Louis, MO, USA

Simple top-down pointer-based quadtree traversal algorithms for four-neighbor traversal, eight-neighbor traversal, and connected-component labeling are proposed. It is shown that for this class of algorithms there exist efficient pointer-based representations that can require as little as 2N bytes, where N is total number of nodes in the tree. The algorithms can also be implemented using a depth-first quadtree representation, at the cost of additional nonrecursive walks over the data structure to locate the arbitrary sons of interior nodes

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:10 ,  Issue: 6 )

Date of Publication:

Nov 1988

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.