A B+-tree structure for large quadtrees

Abstract A B+-tree structure for large quadtrees is presented. This is based on a form of key for a node derived from the ordered list of its ancestors, which facilitate tree traversal. The structure is a list of key values for black nodes which may be accessed in ascending order by key and directly by key. Algorithms for tree traversal and for examination of adjacent nodes are given. Analysis of space requirements and solution times suggests the structure offers advantages in applications involving large quadtrees where use of auxiliary storage is required.

[1]  J. L. Smith,et al.  The Implementation of a Data Base Management System , 1977, Aust. Comput. J..

[2]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[3]  Azriel Rosenfeld,et al.  Region representation: boundary codes from quadtrees , 1980, CACM.

[4]  J. L. Smith,et al.  A data structure and algorithm based on a linear key for a rectangle retrieval problem , 1983, Comput. Vis. Graph. Image Process..

[5]  Michael L. Rhodes,et al.  Organization and Access of Image Data by Areas , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Hanan Samet,et al.  Connected Component Labeling Using Quadtrees , 1981, JACM.

[7]  C. Dyer.  Computing the Euler number of an image from its quadtree , 1980 .

[8]  Douglas Comer,et al.  Ubiquitous B-Tree , 1979, CSUR.

[9]  Kenneth Steiglitz,et al.  Operations on Images Using Quad Trees , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Michael Shneier,et al.  Path-Length distances for quadtrees , 1981, Inf. Sci..

[11]  Hannan Samet,et al.  Region representation: Quadtrees from binary arrays , 1980 .

[12]  Hanan Samet,et al.  Region representation: quadtrees from boundary codes , 1980, CACM.

[13]  Hanan Samet,et al.  An Algorithm for Converting Rasters to Quadtrees , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[14]  Hanan Samet,et al.  Neighbor finding techniques for images represented by quadtrees , 1982, Comput. Graph. Image Process..

[15]  Gregory Michael Hunter,et al.  Efficient computation and data structures for graphics. , 1978 .

[16]  Irene Gargantini.  Detection of connectivity for regions represented by linear quadtrees , 1982 .

[17]  J. R. Woodward,et al.  The Explicit Quad Tree as a Structure for Computer Graphics , 1982 .