The Quadtree and Related Hierarchical Data Structures

ACM Computing Surveys (CSUR)

Volumn 16, Issue 2, 1984, Pages 187-260

  Samet, Hanan ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Geographic information systems; hierarchical data structures; image databases; multiattribute data; multidimensional data structures octrees; pattern recognition; point data; quadtrees; robotics

Indexed keywords

COMPUTER GRAPHICS; GEOGRAPHIC INFORMATION SYSTEM; IMAGE PROCESSING; RECURSIVE DECOMPOSITION; ROBOTICS;

COMPUTER GRAPHICS; DATABASE SYSTEMS; IMAGE PROCESSING; PATTERN RECOGNITION; ROBOTICS;

GEOGRAPHIC INFORMATION SYSTEMS; HIERARCHICAL DATA STRUCTURES; IMAGE DATABASES; QUADTREE;

DATA PROCESSING;

EID: 0021644214     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/356924.356930     Document Type: Article

References (209)

1. Abel, D. J. 1984. A B+-tree structure for large quadtrees. Comput. Vision Gr. Image Process. 27, 1 (July), 19-31.
2. Abel, D. J., and 1983. A data structure and algorithm based on a linear key for a rectangle retrieval problem. Comput. Vision Gr. Image Process. 24, 1 (Oct.), 1-13.
3. Aho, A. V., Hopcroft, J. E., and Ullman, J. D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass.
4. Ahuja, N. 1983. On approaches to polygonal decomposition for hierarchical image representation. Comput. Vision Gr. Image Process. 24, 2 (Nov.) 200-214.
5. Ahuja, N., and Nash, C. 1984. Octree representations of moving objects. Comput. Vision Gr. Image Process. 26, 2 (May), 207-216.
6. Anderson, D. P. 1983. Techniques for reducing pen plotting time, ACM Trans. Gr. 2, 3 (July), 1972 12.
7. Ballard, D. H. 1981. Strip trees: A hierarchical representation for curves. Cammun. ACM 24, 5 (May), 310-321. See also corrigendum, Commun. ACM 25, 3 (Mar. 1982), 213.
8. Bell, S. B. M., Diaz, B. M., Holroyd, F., and Jackson, M. J. 1983. Spatially referenced methods of processing raster and vector data. Image Vision Comput. 1, 4 (Nov.), 211-220.
9. Bentley, J. L. 1975a. A survey of techniques for fixed radius near neighbor searching, SLAC Rep. No. 186, Stanford Linear Accelerator Center, Stanford University, Stanford, Calif., Aug.
10. Bentley, J.L. 1975b. Multidimensional binary search trees used for associative searching. Commun. ACM 18, 9 (Sept.), 509-517.
11. Bentley, J. L., and Friedman, J. H. 1979. Data structures for range searching. ACM Comput. Suru. 11, 4 (Dec.), 397-409.
12. Bentley, J. L., and Stanat, D. F. 1975. Analysis of range searches in quad trees. Inf. Process. Lett. 3, 6 (July), 170-173.
13. BESSLfCH, P. W. 1982. Quadtree construction of binary images by dyadic array transformations. In Proceedings of the IEEE Conference on Pattern Recognition and Image Processing (Las Vegas, Nev., June). IEEE, New York, pp. 550-554.
14. Blum, H. 1967. A transformation for extracting new descriptors of shape. In Models for the Perception of Speech and Visual Form, W. Wathen-Dunn, Ed. M.I.T. Press, Cambridge, Mass., pp. 362-380.
15. Brooks, R. A., and Lozano-Perez, T. 1983. A subdivision algorithm in configuration space for findpath with rotation. In Proceedings of the 7th International Joint Conference on Artificial Intelligence (Karlsruhe, West Germany, Aug.). Kauf-mann, Los Altos, Calif., pp. 799-806.
16. BURKHARDT, W. A. 1983. Interpolation-based index maintenance. BIT 23, 3, 274-294.
17. Burt, P. J. 1980. Tree and pyramid structures for coding hexagonally sampled binary images. Com-
18. Comput. Graphics Image Process. 14, 3 (Nov.), 249-270.
19. Burt, P. J., Hong, T. H., and Rosenfeld, A. 1981. Segmentation and estimation of image region properties through cooperative hierarchical computation. IEEE Trans. Syst. Man Cybern. 11, 12 (Dec.), 802-809.
20. BURTON, W. 1977. Representation of many-sided polygons and polygonal lines for rapid processing, Commun. ACM 20, 3 (Mar.), 166-171.
21. Burton, F. W., and Kollias, J. G. 1983. Comment on the explicit quadtree as a structure for computer graphics. Comput. J. 26, 2 (May), 188.
22. CARLSON, W. E. 1982. An algorithm and data structure for 3D object synthesis using surface patch intersections. Comput. Gr. SIGGRAPH 82 Conf. Proc. 16, 3, 255-264.
23. Chien, C. H., and Aggarwal, J. K. 1984. A normalized quadtree representation. Comput. Vision Gr. Image Process. 26, 3 (June), 331-346.
24. Cohen, E., Lyche, T., and Riesenfeld, R. 1980. Discrete B-splines and subdivision techniques in computer-aided geometric design and computer graphics. Comput. Gr. Image Process. 14, 3 (Oct.), 87-111.
25. Comer, D. 1979. The ubiquitous B-tree. ACM Comput. Surv. 11, 2 (June), 121-137.
26. CONNOLLY, C. I. 1984. Cumulative generation of octree models from range data. In Proceedings of the International Conference on Robotics (Atlanta, Ga., Mar.). IEEE, New York, pp. 25-32.
27. COOK, B. G. 1978. The structural and algorithmic basis of a geographic data base. In Proceedings of the First International Advanced Study Symposium on Topological Data Structures for Geographic Information Systems, G. Dutton, Ed., Harvard Papers on Geographic Information Systems, Harvard University Press, Cambridge, Mass.
28. CREUTZBURG, E. 1981. Complexities of quadtrees and the structure of pictures. Tech. Rep. N/81/74, Computer Science Dept., Friedrich-Schiller University, Jena, East Germany.
29. Davis, L. S., and Roussopoulos, N. 1980. Approximate pattern matching in a pattern database system. Inf. Syst. 5, 2, 107-119.
30. DeCoulon, F., and Johnsen, U. 1976. Adaptive block schemes for source coding of black-and-white facsimile. Electron. Lett. 12, 3, 61-62. See also erratum, Electron. Lett. 12, 6 (1976), 152.
31. DeFloriani, L., Falcidieno, B., Nacy, G., and Pienovi, C. 1982, Yet another method for triangulation and contouring for automated cartography. In Proceedings of the American Congress on Surveying and Mapping (Hollywood, Fla.), F. S. Cardwell, R. Black, and B. M. Cole, Eds. American Society of Photogrammetry, pp. 101-110.
32. DeMillo, R. A., Eisenstat, S. C., and Lipton, R. J. 1978. Preserving average proximity in arrays. Commun. ACM 21, 3 (Mar.), 228-231.
33. Doctor, L. J., and Torborg, J. G. 1981. Display techniques for octree-encoded objects. IEEE Comput. Gr. Appl. 1, 1 (July), 39-46.
34. Duda, R. O., and Hart, P. E. 1973. Pattern Classification and Scene Analysis. Wiley, New York.
35. Dyer, C. R. 1980. Computing the Euler number of an image from its quadtree. Comput. Gr. Image Process. 13, 3 (July), 270-276.
36. Dyer, C. R. 1981. A VLSI pyramid machine for parallel image processing. In Proceedings of the IEEE Conference on Pattern Recognition and Image Processing (Dallas, Tex.). IEEE, New York, pp. 381-386.
37. Dyer, C. R. 1982. The space efficiency of quadtrees. Comput Gr. Image Process. 19, 4 (Aug.), 335-348.
38. Dyer, C. R., Rosenkeld, A., and Samet, H. 1980. Region representation: Boundary codes from quadtrees. Commun. ACM 23, 3 (Mar.), 171-179.
39. Eastman, C. M. 1970. Representations for space planning. Commun. ACM 13, 4 (Apr.), 242-250.
40. Edelsbrunner, H. 1984. Key-problems and key-methods in computational geometry. In Proceedings of the Symposium of Theoretical Aspects of Computer Science (Paris, France), Lecture Notes in Computer Science, vol. 166. Springer Verlag, New York, pp. 1-13.
41. Edelsbrunner, H., and van Leeuwen, J. 1983. Multidimensional data structures and algorithms: A bibliography. Rep. F104, Institute for Information Processing, Technical University of Graz, Graz, Austria, Jan.
42. Edelsbrunner, H., Guibas, L. J., and Stolpi, J. 1985. Optimal point location in a monotone subdivision. SIAM J. Comput. in press.
43. Fagin, R., Nievergelt, J., Pippenger, N., and Strong, H. R. 1979. Extendible hashing-A fast access method for dynamic files. ACM Trans. Database Syst. 4, 3 (Sept.), 315-344.
44. Faugeras, O. D., and Ponce, J. 1983. Prism trees: A hierarchical representation for 3-d objects. In Proceedings of the 7th International Joint Conference on Artificial Intelligence (Karlsruhe, West Germany, Aug.). Kaufmann, Los Altos, Calif., pp. 982-988.
45. Faugeras, O. D., Hebert, M., Mussi, P., and Bois-SONNAT, J. D. 1984. Polyhedral approximation of 3-d objects without holes. Comput. Vision Gr. Image Process. 25, 2 (Feb.), 169-183.
46. Faverjon, B. 1984. Obstacle avoidance using an octree in the configuration space of a manipulator. In Proceedings of the International Conference on Robotics (Atlanta, Ga., Mar.). IEEE, New York, pp. 504-512.
47. Finkel, R. A., and Bentley, J. L. 1974. Quad trees: A data structure for retrieval on composite keys. Acta Inf. 4, 1, 1-9.
48. Fredkin, E. 1960. Trie memory. Commun. ACM 3, 9 (Sept.), 490-499.
49. Freeman, H. 1974. Computer processing of line-drawing images. ACM Comput. Surv. 6, 1 (Mar.), 57-97.
50. Friedman, J. H., Bentley, J. L., and Finkel, R. A. 1977. An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softui. 3, 3 (Sept.), 209-226.
51. Gargantini, I. 1982a. An effective way to represent quadtrees. Commun. ACM25, 12 (Dec.), 905-910.
52. Gargantini, I. 1982b. Linear octtrees for fast processing of three dimensional objects. Comput. Gr. Image Process. 20, 4 (Dec.), 365-374.
53. Gargantini, I. 1983. Translation, rotation, and superposition of linear quadtrees. Int. J. Man-Maeh. Stud. IS, 3 (Mar.), 263
54. Gaston, P. C., and Lozano-Perez, T. 1984. Tactile recognition and localization using object models: The case of polyhedra on a plane. IEEE Trans. Pattern Anal. Mach. Intell. 6, 3 (May), 257-266.
55. Gibson, L., and Lucas, D. 1982. Vectorization of raster images using hierarchical methods. Comput. Gr. Image Process. 20, 1 (Sept.), 82-89.
56. Gillespie, R., and Davis, W. A. 1981. Tree data structures for graphics and image processing. In Proceedings of the 7th Conference of the Canadian Man-Computer Communications Society (Waterloo, Canada, June), pp. 155-161.
57. Gomez, D., and Guzman, A. 1979. Digital model for three-dimensional surface representation. Geo-Process. I, 53-70.
58. Grosky, W. I., AND JAIN, R. 1983. Optimal quadtrees for image segments. IEEE Trans. Pattern Anal Mach. Intell. 5, 1 (Jan.), 77-83.
59. Harary, F. 1969. Graph Theory. Addison-Wesley, Reading, Mass.
60. Hertel, S., and Mehlhorn, K. 1983. Fast triangulation of simple polygons. In Proceedings of the 1983 International Foundations of Computation Theory Conference (Borgholm, Sweden, Aug.), Lecture Notes in Computer Science, vol. 158. Springer Verlag, New York, pp. 207-218.
61. Hinrichs, K.; and Nievergelt, J. 1983. The Grid File: A data structure to support proximity queries on spatial objects. Rep. 54, Institut fur Infor-matik, ETH, Zurich, July.
62. Hoare, C. A. R. 1972. Notes on data structuring. In Structured Programming, 0. J. Dahl, E. W. Dijk-stra, and C. A. R. Hoare, Eds. Academic Press, London, p. 154.
63. Horowitz, S. L., and Pavledis, T. 1976. Picture segmentation by a tree traversal algorithm. J. ACM 23, 2 (Apr.), 368-388.
64. Huffman, D. A. 1952. A method for the construction of minimum-redundancy codes. Proc. IRE 40, 9 (Sept.), 1098-1101.
65. Hunter, G. M. 1978. Efficient computation and data structures for graphics. Ph.D. dissertation, Department of Electrical Engineering and Computer Science, Princeton University, Princeton, N.J.
66. Hunter, G. M., and Steiglitz, K. 1979a. Operations on images using quad trees. IEEE Trans. Pattern Anal. Mach. Intell. 1, 2 (Apr.), 145-158.
67. Hunter, G. M., and Steiglitz, K. 1979b. Linear transformation of pictures represented by quad trees. Comput. Gr. [mage Process. 10, 3 (July), 289-296.
68. Ibrahim, H. A. H. 1984. The connected component labeling algorithm on the NON-VON supercomputer. In Proceedings of the Workshop on Computer Vision: Representation and Control (Annapolis, Md., Apr.). IEEE, New York, pp. 37-45.
69. Ismail, M. G. B., and Steele, R. 1980, Adaptive pel location coding for bilevel facsimile signals. Electron. Lett 16, (May), 361-363
70. Jackins, C., and Tanimoto, S. L. 1980. Oct-trees and their use in representing three-dimensional objects, Comput. Gr. Image Process. 14, 3 (Nov.), 249-270.
71. Jackins, C., and Tanimoto, S. L. 1983. Quad-trees, oct-trees, and fc-trees-A generalized approach to recursive decomposition of Euclidean space. IEEE Trans. Pattern Anal. Mach. InteU. 5, 5 (Sept.), 533-539.
72. Jones, L., and Iyengar, S. S. 1984. Space and time efficient virtual quadtrees. IEEE Trans. Pattern Anal. Mach. Intell. 6, 2 (Mar.), 244-247.
73. Kawaguchi, E., and Endo, T. 1980. On a method of binary picture representation and its application to data compression. IEEE Trans. Pattern Anal. Mach. Intell. 2, 1 (Jan.), 27-35.
74. Kawaguchi, E., Endo, T., and Yokota, M. 1980. DF-expression of binary-valued picture and its relation to other pyramidal representations. In Proceedings of the 5th International Conference on Pattern Recognition (Miami Beach, Fla., Dec.). IEEE, New York, pp. 822-827.
75. Kawaguchi, E., Endo, T., and Matsunaga, J. 1983. Depth-first expression viewed from digital picture processing. IEEE Trans. Pattern Anal. Mach. Intell. 5, 4 (July), 373-384.
76. Kedem, G. 1981. The Quad CIF tree: A data structure for hierarchical on-line algorithms. Tech. Rep. 91, Computer Science Dept., The University of Rochester, Rochester, New York, Sept.
77. Kelly, M. D. 1971. Edge detection in pictures by computer using planning. Mach. Intell. 6, 397-409.
78. KIRKPATRICK, D. 1983. Optimal search in planar subdivisions. SIAM J. Comput. 12, 1 (Feb.), 28-35.
79. Klinger, A. 1971. Patterns and search statistics. In Optimizing Methods in Statistics, J. S. Rustagi, Ed, Academic Press, New York, pp. 303-337.
80. Klinger, A., and Dyer, C. R. 1976. Experiments in picture representation using regular decomposition. Comput. Gr. Image Process. 5, 1 (Mar), 68-105.
81. Klinger, A., and Rhodes, M. L. 1979. Organization and access of image data by areas. IEEE Trans. Pattern Anal Mach. InteU. 1,1 (Jan.), 50-60.
82. Knott, G. D. 1971. Expandable open addressing hash table storage and retrieval. In Proceedings of SIGFIDET Workshop on Data Description, Access, and Control (San Diego, Calif., Nov.). ACM, New York, pp. 187-206.
83. Knowlton, K. 1980. Progressive transmission of grey-scale and binary pictures by simple, efficient, and lossless encoding schemes. Proc. IEEE 68, 7 (July), 885-896.
84. Knuth, D. E. 1973. The Art of Computer Programming, vol. 3, Sorting and Searching. Addison-Wesley, Reading, Mass.
85. Knuth, D. E. 1975. The Art of Computer Programming, vol. 1, Fundamental Algorithms, 2nd ed. Addison-Wesley, Reading, Mass.
86. Lauzon, J. P., Mark, D. M., Kikuchi, L., and Guevara, J. A. 1984. Two-dimensional run-encoding for quadtree representation. Unpublished manuscript, Department of Geography, State University of New York at Buffalo, Buffalo, New York.
87. Lee, D. T., and Shacter, B. J. 1980. Two algorithms for constructing a Delaunay triangulation. Int. J. Comput. Inf. Sci. 9, 3 (June), 219-242.
88. Lee, D. T., and Wong, C. K. 1977. Worst-case analysis for region and partial region searches in multidimensional binary search trees and quad trees. Acta Inf. 9, 1, 23-29.
89. Letelier, P. 1983. Transmission d'images á bas débit pour un systéGme de communication téléphonique adapté aux sourds. ThéGse de docteur-ingénieur, Université de Paris-Sud, Paris, Sept.
90. Li, M., Gbosky, W. I., and Jain, R. 1982. Normalized quadtrees with respect to translations. Corn-put. Gr. Image Process. 20, 1 (Sept.), 72-81.
91. Linn, J, 1973, General methods for parallel searching. Tech. Rep. 81, Digital Systems Laboratory, Stanford University, Stanford, Calif., May.
92. Lipton, R. J., and Tarjan, R. E. 1977. Application of a planar separator theorem. In Proceedings of the 18th Annual IEEE Symposium on the Foundations of Computer Science (Providence, R. I., Oct.). IEEE, New York, pp. 162-170.
93. Lit WIN, W. 1980. Linear hashing: A new tool for file and table addressing. In Proceedings of the 6th International Conference on Very Large Data Bases (Montreal, Oct.). IEEE, New York, pp. 212-223.
94. LOZANO-PEREZ, T. 1981. Automatic planning of manipulator transfer movements. IEEE Trans. Syst. Man Cybern. 11, 10 (Oct.), 681-698.
95. Lumia, R. 1983. A new three-dimensional connected components algorithm. Comput. Vision Gr. Image Process. 23, 2 (Aug.), 207-217.
96. Lumia, R., Shapiro, L., and Zuniga, O. 1983. A new connected components algorithm for virtual memory computers. Comput. Vision Gr. Image Process. 22, 2 (May), 287-300.
97. Martin, J. J. 1982. Organization of geographical data with quad trees and least square approximation. In Proceedings of the IEEE Conference on Pattern Recognition and Image Processing (Las Vegas, Nev., June). IEEE, New York, pp. 458463.
98. Matsuyama, T., Hao, L. V., and Nagao, M. 1984. A file organization for geographic information systems based on spatial proximity. Comput. Vision Gr. Image Process. 26, 3 (June), 303-318.
99. McCLUSKEY, E. J. 1965. Introduction to the Theory of Switching Circuits. McGraw-Hill, New York. pp. 60-61.
100. McKeown, D. M., Jr., and Denlinger, J. L. 1984. Map-guided feature extraction from aerial imagery. In Proceedings of the Workshop on Computer Vision: Representation and Control (Annapolis, Md., Apr.). IEEE, New York, pp. 205-213.
101. Meagher, D. 1982. Geometric modeling using octree encoding. Comput. Gr. Image Process. 19, 2 (June), 129-147.
102. MERRETT, T. H. 1978. Multidimensional paging for efficient database querying. In Proceedings of the International Conference on Management of Data (Milan, Italy, June), pp. 277-289.
103. Merrett, T. H., and Otoo, E. J. 1981. Dynamic multipaging: A storage structure for large shared data banka. In Improving Database Usability and Responsiveness, P. Scheuermann, Ed. Academic Press, New York, pp. 237-254.
104. Merrill, R. D. 1973. Representations of contours and regions for efficient computer search. Commun. ACM 16, 2 (Feb.), 69-82.
105. Milford, D. J., and Wnxrs, P. C. 1984. Quad encoded display, IEE Proc. 131, E3 (May), 70-75.
106. MlNSKY, M., AND PAPERT, S. 1969. Perceptions: An Introduction to Computational Geometry. M.I.T. Press, Cambridge, Mass.
107. Morton, G. M. 1966, A computer oriented geodetic data base and a new technique in file sequencing. Unpublished manuscript, IBM, Ltd., Ottawa, Canada.
108. Mudur, S. P., AND Koparkar, P. A. 1984. Interval methods for processing geometric objects. IEEE Comput. Gr. Appl. 4, 2 (Feb.), 7-17.
109. NAGY, G., AND Wagle, S. 1979. Geographic data processing. ACM Comput. Sum, 11,2 (June), 139-181.
110. Nievergelt, J., and Preparata, F. P. 1982. Plane-sweep algorithms for intersecting geometric figures. Commun. ACM 25, 10 (Oct.), 739-746.
111. Nievergelt, J., Hinterberger, H., and Sevcik, K. C. 1984. The Grid File: An adaptable, symmetric multikey file structure. A CM Trans. Database Syst. 9, 1 (Mar.), 38-71.
112. Nilsson, N. J. 1969. A mobile automaton: An application of artificial intelligence techniques. In Proceedings of the 1st International Joint Conference on Artificial Intelligence (Washington D.C.). Kaufmann, Los Altos, Calif., pp. 509-520.
113. Oliver, M. A., AND Wiseman, N. E. 1983a, Operations on quadtree-encoded images. Comput. J. 26, 1 (Feb.), 83-91.
114. Oliver, M. A., AND Wiseman, N. E. 1983b. Operations on quadtree leaves and related image areas. Comput. J. 26, 4 (Nov.), 375-380.
115. Omolayole, J. O., and Klinger, A, 1980. A hierarchical data structure scheme for storing pictures. In Pictorial Information Systems, S. K.
116. Chang and K. S. Fu, Eds. Springer-Verlag, Berlin and New York, 1980.
117. Orenstein, J. A. 1982. Multidimensional tries used for associative searching. Inf. Process. Lett. 14, 4 (June), 150-157.
118. Orenstein, J. A. 1983. A dynamic hash file for random and sequential accessing. In Proceedings of the 6th International Conference on Very Large Data Bases (Florence, Italy, Oct.). IEEE, New York, pp. 132-141.
119. Orenstein, J. A., and Merrett, T. H. 1984. A class of data structures for associative searching. In Proceeding of the 3rd ACM SIGACT-SIG-MOD Symposium on Principles of Database Systems (Waterloo, Ontario, Apr.). ACM, New York, pp. 181-190.
120. O-Rourke, J. 1981. Dynamically quantized spaces for focusing the Hough Transform. In Proceedings of the 6th International Joint Conference on Artificial Intelligence (Vancouver, B.C., Aug.). Kaufmann, Los Altos, Calif., pp. 737-739.
121. O-Rourke, J., and Sloan, K. R., Jr. 1984. Dynamic quantization: Two adaptive data structures for multidimensional squares. IEEE Trans. Pattern Anal. Mach. Intell. 6, 3 (May), 266-280.
122. Ouksel, M., and Scheuermann, P. 1983. Storage mappings for multidimensional linear dynamic hashing. In Proceedings of the 2nd ACM SI-GACT-SIGMOD Symposium on Principles of Database Systems (Atlanta, Ga., Mar.). ACM, New York, pp. 90-105.
123. Overmars, M. H. 1983. The Design of Dynamic Data Structures, Lecture Notes in Computer Science, vol. 156. Springer-Verlag, New York.
124. Overmars, M. H., and van Leeuwen, J. 1982. Dynamic multi-dimensional data structures based on quad- and k-d treeg. Acta Inf. 17, 3, 267-285.
125. Peters, F. 1984. An algorithm for transformations of pictures represented by quadtrees, Dept, of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
126. Peucker, T. 1976. A theory of the cartographic line. Int. Yearb. Cartogr. 16, 34-43.
127. Peuquet, D. J. 1979. Raster processing: An alternative approach to automated cartographic data handling. Am. Cartogr. 2 (Apr.), 129-239.
128. Peuquet, D. J. 1983. A hybrid data structure for the storage and manipulation of very large spatial data sets. Comput. Vision Gr. Image Process. 24, 1 (Oct.), 14-27.
129. Pfaltz, J. L., and Rosenfeld, A. 1967. Computer representation of planar regions by their skeletons. Commun. ACM 10, 2 (Feb.), 119-122.
130. Pietikajnen, M., Rosenfeld, A., and Walter, I. 1982. Split-and-link algorithms for image segmentation. Pattern Recognition 15, 4, 287-298.
131. Raman, V., and Iyengar, S. S. 1983. Properties and applications of forests of quadtrees for pictorial data representation. BIT 23, 4, 472-486.
132. Ranade, S. 1981. Use of quadtrees for edge enhancement. IEEE Trans. Syst. Man, Cybern. 11, 5 (May), 370-373.
133. Ranade, S., and Shneier, M. 1981. Using quadtrees to smooth images. IEEE Trans. Syst. Man Cybern. 11, 5 (May), 373-376.
134. Ranade, S., Rosenfeld, A., and Pkewitt, J. M. S. 1980. Use of quadtrees for image segmentation. TR-878, Dept, of Computer Science, University of Maryland, College Park, Md., Feb.
135. Ranade, S., Rosenfeld, A., and Samet, H. 1982. Shape approximation using quadtrees. Pattern Recognition 15, 1, 31-40.
136. Reddy, D. R., and Rubin, S. 1978. Representation of three-dimensional objects. CMU-CS-78-113, Computer Science Dept., Carnegie-Mellon University, Pittsburgh, Apr.
137. REQUICHA, A. A. G. 1980. Representations of rigid solids: Theory, methods, and systems. ACM Comput. Surv. 12, 4 (Dec.), 437-464.
138. Rheinboldt, W. C., and Mesztenyi, C. K. 1980. On a data structure for adaptive finite element mesh refinements. ACM Trans. Math. Softw. 6, 2 (June), 166-187.
139. Riseman, E. M., and Arbib, M. A. 1977. Computational techniques in the visual segmentation of static scenes. Comput. Gr. Image Process. 6, 3 (June), 221-276.
140. Robinson, J. T. 1981. The fc-d-Et-tree: A search structure for large multidimensional dynamic indexes. In Proceedings of the SIGMOD Conference (Ann Arbor, Mich., Apr.). ACM, New York, pp. 10-18.
141. ROSENFELD, A., Ed. 1983. Multiresolution Image Processing and Analysis. Springer-Verlag, Berlin and New York.
142. ROSENFELD, A. 1984. Picture processing 1984. Comput. Vision Gr. Image Process. 26, 3 (June), 347384.
143. Rosenfeld, A., and Kak, A. C. 1982. Digital Picture Processing, 2nd ed. Academic Press, New York.
144. Rosenfeld, A., and Pfaltz, J. L. 1966. Sequential operations in digital image processing. J. ACM 13, 4 (Oct.), 471-494.
145. Rosenfeld, A., Samet, H., Shaffer, C., and Webber, R. E. 1982. Application of hierarchical data structures to geographical information systems. TR-1197, Computer Science Dept., University of Maryland, College Park, Md., June.
146. Rosenfeld, A., Samet, H., Shaffer, C., and Webber, R. E. 1983. Application of hierarchical data structures to geographical information systems phase II. TR-1327, Computer Science Dept., University of Maryland, College Park, Md., Sept.
147. Roth, S. D. 1982. Ray casting for modeling solids. Comput. Gr. Image Process. IS, 2 (Feb.), 109-144.
148. Rutovitz, D. 1968. Data structures for operations on digital images. In Pictorial Pattern Recognition, G. C. Cheng et al., Eds. Thompson Book Co., Washington D.C., pp. 105 133.
149. Samet, H. 1980a. Region representation: Quadtrees from boundary codes. Commun. ACM 23, 3 (Mar.), 163-170.
150. Samet, H. 1980b. Region representation: Quadtrees from binary arrays. Comput. Gr. Image Process. 13, 1 (May), 88-93.
151. Samet, H. 1980c. Deletion in two-dimensional quad trees. Commun. ACM 23, 12 (Dec.), 703-710.
152. SAMET, H. 1981a. An algorithm for converting rasters to quadtrees. IEEE Trans. Pattern Ami. Mack. Intell. 3, 1 (Jan.), 93-95.
153. SAMET, H. 1981b. Connected component labeling using quadtrees. J. ACM 28, 3 (July), 487-501.
154. Samet, H. 1981c. Computing perimeters of images represented by quadtrees. IEEE Trans. Pattern Anal. Mach. Intell. 3, 6 (Nov.), 683-687.
155. Samet, H. 1982a. Neighbor finding techniques for images represented by quadtrees. Comput. Gr. Image Process. 18, 1 (Jan.), 37-57.
156. Samet, H. 1982b. Distance transform for images represented by quadtrees. IEEE Tram. Pattern Anal. Mach. Intell. 4, 3 (May), 298-303.
157. SAMET, H. 1983. A quadtree medial axis transform. Commun. ACM 26, 9 (Sept.), 680-693. See also corrigendum, Commun. ACM 27, 2 (Feb. 1984), 151.
158. Samet, H. 1984. Algorithms for the conversion of quadtrees to rasters. Comput. Vision Gr. Image Process. 26, 1 (Apr.), 1-16.
159. Samet, H. 1985a. A top-down quadtree traversal algorithm. IEEE Trans. Pattern Anal Mach. Intell. 7, 1 (Jan.) in press. Also TR-1237, Computer Science Dept., University of Maryland.
160. Samet, H. 1985b. Reconstruction of quadtrees from quadtree medial axis transforms. Comput. Vision Gr. Image Process. 29, 2 (Feb.) in press. Also TR-1224, Computer Science Dept., University of Maryland.
161. Samet, H. 1985c. Data structures for quadtree approximation and compression. Commun. ACM28 in press. Also TR-1209, Computer Science Dept., University of Maryland.
162. Samet, H., and Krishnamurthy, E. V. 1983. A quadtree-baaed matrix manipulation system. Unpublished manuscript of work in progress.
163. Samet, H., and Rosenfeld, A. 1980. Quadtree structures for image processing. In Proceedings of the 5tk International Conference on Pattern Recognition (Miami Beach, Fla., Dec.). IEEE, New York, pp. 815-818.
164. Samet, H., and Shaffer, C. A. 1984. A model for the analysis of neighbor finding in pointer-based quadtrees. TR-1432, Computer Science Dept., University of Maryland, College Park, Md., Aug.
165. Samet, H., and Tamminen, M. 1984. Efficient image component labeling. TR-1420, Computer Science Dept., University of Maryland, College Park, Md., July.
166. Samet, H., and Tamminen, M. 1985. Computing geometric properties of images represented by linear quadtrees. IEEE Trans. Pattern Anal. Mach. Intell. 7, 1 (Jan.) in press. Also TR-1359, Computer Science Dept., University of Maryland.
167. Samet, H., and Webber, R. E. 1982. On encoding boundaries with quadtrees. TR-1162, Computer Science Dept., University of Maryland, College Park, Md., Feb.
168. Samet, H., and Webber, R. E. 1983, Using quadtrees to represent polygonal maps. In Proceedings of Computer Vision and Pattern Recognition 83 (Washington, DC, June). IEEE, New York, pp. 127-132. Also TR-1372, Computer Science Dept., University of Maryland.
169. Samet, H., and Webber, R. E. 1984. On encoding boundaries with quadtrees, IEEE Trans. Pattern Anal. Mach. Intell. 6, 3 (May), 365-369.
170. ShamOS, M. L. 1978. Computational geometry. Ph.D. dissertation, Dept, of Computer Science, Yale University, New Haven, Conn.
171. Shamos, M. I., and Hoey, D. 1975. Closest-point problems. In Proceedings of the 16th Annual IEEE Symposium on the Foundations of Computer Science (Berkeley, Calif., Oct.). IEEE, New York, pp. 151-162.
172. Shneier, M. 1981a. Calculations of geometric properties using quadtrees. Comput. Gr. Image Process. 16, 3 (July), 296-302.
173. Shneier, M. 1981b. Path-length distances for quadtrees. Inf. Sci. 23, 1 (Feb.), 49-67.
174. Shneier, M. 1981c. Two hierarchical linear feature representations: Edge pyramids and edge quadtrees. Comput. Gr. Image Process. 17, 3 (Nov.), 211-224.
175. Sloan, K. R., Jr. 1981. Dynamically quantized pyramids. In Proceedings of the 6th International Joint Conference on Artificial Intelligence (Vancouver, B.C., Aug.). Kaufmann, Los Altos, Calif., pp. 734-736.
176. Sloan, K. R., Jr., and Tanimoto, S. L. 1979. Progressive refinement of raster images. IEEE Trans. Comput. 28, 11 (Nov.), 871-874.
177. Shihari, S. N. 1981. Representation of three-dimensional digital images. ACM Comput. Surv. 13, 1 (Dec.), 399-424.
178. Sutherland, I. E., Sproull, R. F., and Schu-macker, R. A. 1974, A characterization of ten hidden-surface algorithms. ACM Comput. Surv. 6, 1 (Mar.), 1-55.
179. Tamminen, M. 1981. The EXCELL method for efficient geometric access to data. Acta Polytech. Sc and. Mathematics and Computer Science Series No, 34, Helsinki.
180. Tamminen, M. 1982. Hidden lines using the EXCELL method. Comput. Gr. Forum 11, 3, 96-105.
181. Tamminen, M. 1983. Performance analysis of cell based geometric file organizations. Comput. Vision Gr. Image Process. 24, 2 (Nov.), 168-181.
182. Tamminen, M. 1984a. Comment on quad- and oct-trees. Commun. ACM 27, 3 (Mar.), 248-249.
183. Tamminen, M. 1984b. Encoding pixel trees. Com-pul. Vision Gr. Image Process. 28, 1 (Oct.), 44-57.
184. Tamminen, M., and Samet, H. 1984. Efficient octree conversion by connectivity labeling. In Proceedings of the SIGGRAPH 84 Conference (Minneapolis, Minn., July). ACM, New York, pp. 43-51.
185. Tanimoto, S. 1976. Pictorial feature distortion in a pyramid. Comput. Gr. Image Process. 5, 3 (Sept.), 333-352.
186. Tanimoto, S. 1979. Image transmission with gross information first. Comput. Graph. Image Process. 9, 1 (Jan.), 72-76.
187. Tanimoto, S., and Klnger, A. Eds. 1980. Structured Computer Vision. Academic Press, New York.
188. Tanimoto, S., and Pavlidis, T. 1975. A hierarchical data structure for picture processing, Comput. Gr. Image Process. 4, 2 (June), 104-119.
189. Tarjan, R. E. 1975. Efficiency of a good but not linear set union algorithm. J. ACM 22, 2 (Apr.), 215-225.
190. Totjssaint, G. T. 1980. Pattern recognition and geometrical complexity. In Proceedings of the 5th International Conference on Pattern Recognition (Miami Beach, Fla., Dec.). IEEE, New York, pp. 1324-1346.
191. Tropf, H., and Herzog, H. 1981. Multidimensional range search in dynamically balanced trees. Angcw. Inf. 2, 71-77.
192. Tucker, L. W. 1984a. Control strategy for an expert vision system using quadtree refinement. In Proceedings of the Workshop on Computer Vision: Representation and Control (Annapolis, Md., Apr.). IEEE, New York, pp. 214-218.
193. Tucker, L. W. 1984b. Computer vision using quadtree refinement. Ph.D. dissertation, Dept, Electrical Engineering and Computer Science, Polytechnic Institute of New York, Brooklyn, N.Y., May.
194. Uhr, L. 1972. Layered “recognition cone” networks that preprocess, classify, and describe. IEEE Trans. Comput 21, 7 (July), 758-768.
195. Unnikrishnan, A., and Venkatesh, Y. V. 1984. On the conversion of raster to linear quadtrees. Department of Electrical Engineering, Indian Institute of Science, Bangalore, India, May.
196. van Leeuwen, J., and WOOD, D. 1981. The measure problem for rectangular ranges in d-space. J. Algorithms 2, 3 (Sept.), 282-300.
197. van Lierop, M. L. P. 1984. Transformations on pictures represented by leafcodes. Dept, of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
198. Warnock, J. L. 1969. A hidden surface algorithm for computer generated half tone pictures. TR 415, Computer Science Dept., University of Utah, Salt Lake City, June.
199. Webber, R. E. 1984. Analysis of quadtree algorithms. Ph.D. dissertation, Computer Science Dept., University of Maryland, College Park.
200. Md., Mar. Also TR-1376, Computer Science Dept., University of Maryland.
201. Weber, W. 1978. Three types of map data structures, their ANDs and NOTs, and ft possible OR. In Proceedings of the 1st International Advanced Study Symposium on Topological Data Structures for Geographic Information Systems, G. Dutton, Ed. Harvard Papers on Geographic Information Systems, Harvard Univ. Press, Cambridge, Mass.
202. Willard, D. E. 1982. Polygon retrieval. SIAM J. Comput. 11, 1 (Feb.), 149-165.
203. Woodwark, J. R. 1982. The explicit quadtree as a structure for computer graphics. Comput. J. 25, 2 (May), 235-238.
204. Wu, A. Y., Hong, T. H., and Rosenfeld, A, 1982. Threshold selection using quadtrees.
205. IEEE Trans. Pattern Anal. Math. IriLe.ll. 4, 1 (Jan.), 90-94.
206. Yamaguchi, K., Kunii, T. L., Fujimura, K., and Toriya, H. 1984. Octree-related data structures and algorithms. IEEE Comput. Gr. Appl. 4, 1 (Jan.), 53-59.
207. Yah, M. 1984. Generating quadtrees of cross-sections from octrees. Comput. Vision Gr. Image Process. 27, 2 (Aug.), 211-238.
208. Yau, M., and Srihari, S. N. 1983. A hierarchical data structure for multidimensional digital images. Commun. ACM 26, 7 (July), 504-515.
209. Yerry, M. A., and Shepard, M. S. 1983. A modified quadtree approach to finite element mesh generation. IEEE Comput. Gr. AppL 3, 1 (Jan./ Feb.), 39-46.