This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Quadtree Traversal Algorithms for Pointer-Based and Depth-First Representations
November 1988 (vol. 10 no. 6)
pp. 955-960

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.

[1] H. Samet, "The quadtree and related hierarchical data structures,"Comput. Surveys, vol. 16, pp. 187-260, 1984.
[2] E. Kawaguchi, T. Endo, and J. Matsunaga, "Depth-first expression viewed from digital picture processing,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-5, no. 4, July 1983.
[3] H. Samet, "A top-down quadtree traversal algorithm,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-7, no. 1, Jan. 1985.
[4] M. Oliver and N. Wiseman, "Operations on quadtree encoded images,"Comput. J., vol. 26, no. 1, 1983.
[5] I. Gargantini, "An Effective Way to Represent Quadtrees,"CACM, Dec. 1982, pp. 905-910.
[6] H. Samet, A. Rosenfeld, C. Shaffer, and R. Webber, "A geographic information system using quadtrees,"Pattern Recognition, vol. 17, no. 6, 1984.
[7] G.M. Hunter, "Efficient Computation and Data Structures for Graphics," doctoral dissertation, Princeton Univ., Princeton, N.J., 1978.

Index Terms:
computerized picture processing; computerized pattern recognition; depth-first representations; quadtree traversal algorithms; connected-component labeling; pointer-based representations; nodes; data structure; computerised pattern recognition; computerised picture processing; trees (mathematics)
Citation:
D.R. Fuhrmann, "Quadtree Traversal Algorithms for Pointer-Based and Depth-First Representations," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 10, no. 6, pp. 955-960, Nov. 1988, doi:10.1109/34.9118
Usage of this product signifies your acceptance of the Terms of Use.