Using Quadtrees to Represent Spatial Data

Use of the quadtree data structure in representing spatial data is reviewed. The focus is on its properties that make it appropriate for applications in image processing. A number of operations in which the quadtree finds use are discussed.

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

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

[3]  K. Meine,et al.  International yearbook of cartography , 1973 .

[4]  Warren Burton,et al.  Representation of many-sided polygons and polygonal lines for rapid processing , 1977, CACM.

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

[6]  T. Peucker.  A THEORY OF THE CARTOGRAPHIC LINE , 1975 .

[7]  Jon Louis Bentley,et al.  Data Structures for Range Searching , 1979, CSUR.

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

[9]  Eiji Kawaguchi,et al.  On a Method of Binary-Picture Representation and Its Application to Data Compression , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Leonard Uhr,et al.  Layered "Recognition Cone" Networks That Preprocess, Classify, and Describe , 1972, IEEE Transactions on Computers.

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

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

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

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

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

[16]  Azriel Rosenfeld,et al.  Application of Hierarchical Data Structures to Geographical Information Systems. , 1983 .

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

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

[19]  Nils J. Nilsson,et al.  A mobius automation: an application of artificial intelligence techniques , 1969, IJCAI 1969.

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

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

[22]  L. Gibson,et al.  Vectorization of raster images using hierarchical methods , 1982, Comput. Graph. Image Process..

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

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

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

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

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

[28]  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 .

[29]  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..

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

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

[32]  Azriel Rosenfeld,et al.  Sequential Operations in Digital Picture Processing , 1966, JACM.

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

[34]  Markku Tamminen,et al.  Encoding pixel trees , 1984, Comput. Vis. Graph. Image Process..

[35]  Charles R. Dyer,et al.  Experiments on Picture Representation Using Regular Decomposition , 1976 .

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

[37]  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.

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

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

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

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

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

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

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

[45]  Neil E. Wiseman,et al.  Operations on Quadtree Encoded Images , 1983, Comput. J..

[46]  George Nagy,et al.  Geographic Data Processing , 1979, CSUR.

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

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

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

[50]  M. Shneier.  Two hierarchical linear feature representations: Edge pyramids and edge quadtrees , 1981 .

[51]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

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

[53]  Robert E. Tarjan,et al.  Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.