Quadtree Traversal Algorithms for Pointer-Based and Depth-First Representations

Authors:
D. R. Fuhrmann
Affiliations:
Washington Univ., St. Louis, MO
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1988

Citing 3
Cited 2

The Quadtree and Related Hierarchical Data Structures

ACM Computing Surveys (CSUR)
An effective way to represent quadtrees

Communications of the ACM
Efficient computation and data structures for graphics.

Efficient computation and data structures for graphics.

Efficient gradient-domain compositing using quadtrees

ACM SIGGRAPH 2007 papers
Thinning algorithms based on quadtree and octree representations

Information Sciences: an International Journal

Quantified Score

Hi-index	0.14

Visualization

Abstract

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.