A Tutorial on Quadtree Research

Region representation is an important issue in image processing, cartography, and computer graphics. A wide number of representations is currently in use. Recently, there has been much interest in a hierarchical data structure termed the quadtree. It is compact and depending on the nature of the region saves space as well as time and also facilitates operations such as search. In this section we give a brief overview of the quadtree data structure and related research results.

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

[2]  Chris L. Jackins,et al.  Oct-trees and their use in representing three-dimensional objects , 1980 .

[3]  Theodosios Pavlidis,et al.  A hierarchical data structure for picture processing , 1975 .

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

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

[6]  T. M. Williams,et al.  Optimizing Methods in Statistics , 1981 .

[7]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[8]  Irene Gargantini,et al.  An effective way to represent quadtrees , 1982, CACM.

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

[10]  Michael A. Arbib,et al.  Computational Techniques in the Visual Segmentation of Static Scenes. , 1977 .

[11]  Charles R. Dyer.  The space efficiency of quadtrees , 1982, Comput. Graph. Image Process..

[12]  R. Brubaker.  Models for the perception of speech and visual form: Weiant Wathen-Dunn, ed.: Cambridge, Mass., The M.I.T. Press, I–X, 470 pages , 1968 .

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

[14]  G. M. Hunter,et al.  Linear transformation of pictures represented by quad trees , 1979 .

[15]  Robert F. Sproull,et al.  Principles in interactive computer graphics , 1973 .

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

[17]  Hanan Samet,et al.  Deletion in two-dimensional quad trees , 1980, CACM.

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

[19]  Herbert Freeman,et al.  Computer Processing of Line-Drawing Images , 1974, CSUR.

[20]  S. Ranade.  Use of Quadtrees for Edge Enhancement , 1980 .

[21]  Azriel Rosenfeld,et al.  Shape approximation using quadtrees , 1982, Pattern Recognit..

[22]  Narendra Ahuja.  APPROACHES TO RECURSIVE IMAGE DECOMPOSITION. , 1981 .

[23]  Hanan Samet,et al.  A quadtree medial axis transform , 1983, Commun. ACM.

[24]  Ramesh C. Jain,et al.  Optimal Quadtrees for Image Segments , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[25]  Hanan Samet,et al.  Distance Transform for Images Represented by Quadtrees , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[26]  Hanan Samet,et al.  Computing Perimeters of Regions in Images Represented by Quadtrees , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[27]  A. Rosenfeld,et al.  Use of Quadtrees for Image Segmentation , 1980 .

[28]  Charles M. Eastman.  Representations for space planning , 1970, CACM.

[29]  Hanan Samet,et al.  Algorithms for the conversion of quadtrees to rasters , 1984, Comput. Vis. Graph. Image Process..

[30]  Hanan Samet,et al.  On Encoding Boundaries with Quadtrees , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[31]  Sargur N. Srihari,et al.  A hierarchical data structure for multidimensional digital images , 1983, CACM.

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

[33]  Allen Klinger,et al.  PATTERNS AND SEARCH STATISTICS , 1971 .

[34]  G. C. Cheng.  Pictorial pattern recognition , 1969, Pattern Recognit..

[35]  Azriel Rosenfeld,et al.  Computer representation of planar regions by their skeletons , 1967, CACM.

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

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

[38]  Dana H. Ballard,et al.  Strip trees: a hierarchical representation for curves , 1981, CACM.

[39]  Ming Li,et al.  Normalized quadtrees with respect to translations , 1982, Comput. Graph. Image Process..

[40]  Azriel Rosenfeld,et al.  Threshold Selection Using Quadtrees , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[41]  S. Tanimoto.  Pictorial feature distortion in a pyramid , 1976 .

[42]  Hanan Samet,et al.  Computing Perimeters of Images Represented by Quadtrees , 1979 .

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

[44]  Nikitas A. Alexandridis,et al.  Picture decomposition, tree data-structures, and identifying directional symmetries as node combinations , 1978 .

[45]  D R Reddy,et al.  Representation of Three-Dimensional Objects. , 1978 .

[46]  Steven L. Tanimoto,et al.  Quad-Trees, Oct-Trees, and K-Trees: A Generalized Approach to Recursive Decomposition of Euclidean Space , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[47]  Azriel Rosenfeld,et al.  Digital Picture Processing , 1976 .

[48]  S. Ranade,et al.  Using Quadtrees to Smooth Images , 1980 .

[49]  M. Shneier.  Calculations of geometric properties using quadtrees , 1981 .