Bibliography on quadtrees and related hierarchical data structures

  • Hanan Samet
Conference paper
Part of the EurographicSeminars book series (FOCUS COMPUTER)

Abstract

This bibliography is an updated version of the one published in ACM Computing Surveys [214].

Keywords

IEEE Transaction Computer Graphic Path Planning Machine Intelligence Medial Axis 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    D.J. Abel, Comments on “detection of connectivity for regions represented by linear quadtrees”, Computers and Mathematics with Applications 10, 2(1984), 167–170. [geometric property measurement]MATHCrossRefGoogle Scholar
  2. 2.
    D.J. Abel and J.L. Smith, A data structure and algorithm based on a linear key for a rectangle retrieval problem, Computer Vision, Graphics, and Image Processing 24, 1(October 1983), 1–13. [rectangles]CrossRefGoogle Scholar
  3. 3.
    D.J. Abel and J.L. Smith, A simple approach to the nearest-neighbor problem, The Australian Computer Journal 16, 4(November 1984), 140–146. [point data]Google Scholar
  4. 4.
    D.J. Abel and J.L. Smith, A data structure and query algorithm for a database of areal entities, The Australian Computer Journal 16, 4(November 1984), 147–154. [region data]Google Scholar
  5. 5.
    N. Ahuja, On approaches to polygonal decomposition for hierarchical image representation, Computer Vision, Graphics, and Image Processing 24, 2(November 1983), 200–214. [region representation]CrossRefGoogle Scholar
  6. 6.
    N. Ahuja and C. Nash, Octree representations of moving objects, Computer Vision, Graphics, and Image Processing 26, 2(May 1984), 207–216. [three-dimensional data]CrossRefGoogle Scholar
  7. 7.
    N. Alexandridis and A. Klinger, Picture decomposition, tree data-structures, and identifying directional symmetries as node combinations, Computer Graphics, and Image Processing 8, l(August 1978), 43–77. [region representation]CrossRefGoogle Scholar
  8. V.V. Alexandrov and N.D. Grosky, Recursive approach to associative storage and search of information in data bases, Proceedings of the Finnish-Soviet Symposium on Design and Application of Data Base Systems, Turku, Finland, 1980, 271–284. [region representation]Google Scholar
  9. 9.
    V.V. Alexandrov, N.D. Grosky, and A.O. Polyakov, Recursive algorithms of data representation and processing, Academy of Sciences of the USSR, Leningrad Research Center, Leningrad, 1979. [region representation]Google Scholar
  10. 10.
    D.P. Anderson, Techniques for reducing pen plotting time, ACM Transactions on Graphics 2, 3(July 1983), 197–212. [computer graphics; point data]CrossRefGoogle Scholar
  11. 11.
    F.P. Andresen, L.S. Davis, R.D. Eastman, and S. Kambhampati, Visual algorithms for autonomous navigation, Proceedings of the International Conference on Robotics, St. Louis, March 1985, 856–861. [three-dimensional data, path planning]Google Scholar
  12. 12.
    E. Artzy, G. Frieder, and G.T. Herman, The theory, design, implementation, and evaluation of a surface detection algorithm, Computer Graphics and Image Processing 15, 1(January 1981), 1–24. [three-dimensional data]CrossRefGoogle Scholar
  13. 13.
    H.H. Atkinson, I. Gargantini, and T.R.S. Walsh, Counting regions, holes, and their nesting level in time proportional to their border, Computer Vision, Graphics, and Image Processing 29, 2(February 1985), 196–215. [geometric property measurement]CrossRefGoogle Scholar
  14. 14.
    D. Avis, A survey of heuristics for the weighted matching problem, Networks 13, 4(1983), 475–493. [point data; Euclidean matching]MathSciNetMATHCrossRefGoogle Scholar
  15. 15.
    D.H. Ballard, Strip trees: A hierarchical representation for curves, Communications of the ACM 24, 5(May 1981), 310–321 (see also corrigendum, Communications of the ACM 25, 3(March 1982), 213). [line data]CrossRefGoogle Scholar
  16. 16.
    R. Barera and A.M. Vazquez A hierarchical method for representing terrain relief, Proceedings of the Pecora 9 Symposium on Spatial Information Technologies for Remote Sensing Today and Tomorrow, Sioux Falls, South Dakota, October 1984, 87–92. [surface representation]Google Scholar
  17. 17.
    M.A. Bauer, Set operations in linear quadtrees, Computer Vision, Graphics, and Image Processing 29, 2(February 1985), 248–258. [region data]CrossRefGoogle Scholar
  18. 18.
    S.B.M. Bell, B.M. Diaz, F. Holroyd, and M.J. Jackson, Spatially referenced methods of processing raster and vector data, Image and Vision Computing 1, 4(November 1983), 211–220. [region representation]CrossRefGoogle Scholar
  19. 19.
    J.L. Bentley, A survey of techniques for fixed radius near neighbor searching, SLAC Report No. 186, Stanford Linear Accelerator Center, Stanford University, Stanford, CA, August 1975. [point data]Google Scholar
  20. 20.
    J.L. Bentley, Multidimensional binary search trees used for associative searching, Communications of the ACM 18, 9(September 1975), 509–517. [point data]MathSciNetMATHCrossRefGoogle Scholar
  21. 21.
    J.L. Bentley, Decomposable searching problems, Information Processing Letters 8, June 1979, 133–136. [point data]MathSciNetMATHCrossRefGoogle Scholar
  22. 22.
    J.L. Bentley, Multi-dimensional divide-and-conquer, Communications of the ACM 23, 4(April 1980), 214–229. [point data]MathSciNetMATHCrossRefGoogle Scholar
  23. 23.
    J.L. Bentley and J.H. Friedman, Data Structures for range searching, ACM Computing Surveys If 4(December 1979), 397–409. [point data]CrossRefGoogle Scholar
  24. 24.
    J.L. Bentley and H.A. Maurer, A note on Euclidean near neighbor searching in the plane, Information Processing Letters 8, 3(March 1979), 133–136. [point data]MathSciNetMATHGoogle Scholar
  25. 25.
    J.L. Bentley and H.A. Maurer, Efficient worst-case data structures for range searching, Acta Informatica 13, 2(1980), 155–168. [point data]MathSciNetMATHCrossRefGoogle Scholar
  26. 26.
    J.L. Bentley and J. Saxe, Decomposable searching problems I: static to dynamic transformations, Journal of Algorithms 1, (1980), 301–358. [point data]MathSciNetMATHCrossRefGoogle Scholar
  27. 27.
    J.L. Bentley and D.F. Stanat, Analysis of range searches in quad trees, Information Processing Letters 3, 6(July 1975), 170–173. [point data]MathSciNetMATHCrossRefGoogle Scholar
  28. 28.
    J.L. Bentley, D.F. Stanat, and E.H. Williams Jr., The complexity of fixed radius near neighbor searching, Information Processing Letters 6, December 1977, 209–212. [point data]MathSciNetMATHCrossRefGoogle Scholar
  29. 29.
    P.W. Besslich, Quadtree construction of binary images by dyadic array transformations, Proceedings of the IEEE Conference on Pattern Recognition and Image Processing, Las Vegas, 1982, 550–554. [hardware]Google Scholar
  30. 30.
    H. Blum, 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, MA, 1967, 362–380. [medial axis transforms]Google Scholar
  31. 31.
    A. Bolour, Optimality properties of multiple-key hashing functions, Journal of the ACM 26, 2(April 1979), 196–210. [point data]MathSciNetMATHCrossRefGoogle Scholar
  32. 32.
    R.A. Brooks and T. Lozano-Perez, A subdivision algorithm in configuration space for findpath with rotation, Proceedings of the Seventh International Joint Conference on Artificial Intelligence, Karlsruhe, West Germany, August 1983, 799–806. [three-dimensional data, path planning]Google Scholar
  33. 33.
    W.A. Burkhardt, Interpolation-based index maintenance, BIT 23, 3(1983), 274–294. [point data]MathSciNetCrossRefGoogle Scholar
  34. 34.
    P.J. Burt, Tree and pyramid structures for coding hexagonally sampled binary images, Computer Graphics and Image Processing 14, 3(November 1980), 249–270. [pyramids]MathSciNetCrossRefGoogle Scholar
  35. 35.
    P.J. Burt, T.H. Hong, and A. Rosenfeld, Segmentation and estimation of image region properties through cooperative hierarchical computation, IEEE Transactions on Systems, Man, and Cybernetics 11, 12(December 1981), 802–809. [pyramids]CrossRefGoogle Scholar
  36. 36.
    F.W. Burton and J.G. Kollias, Comment on the explicit quadtree as a structure for computer graphics, Computer Journal 26, 2(May 1983), 188. [region representation]CrossRefGoogle Scholar
  37. 37.
    F.W. Burton, V.J. Kollias, and J.G. Kollias, Expected and worst-case storage requirements for quadtrees, Pattern Recognition Letters 3, 2(March 1985), 131–135. [storage requirements]MATHCrossRefGoogle Scholar
  38. 38.
    F.W. Burton, J.G. Kollias, and N.A. Alexandridis, Implementation of the exponential pyramid data structure with application to determination of symmetries in pictures, Computer Vision, Graphics, and Image Processing 25, 2(February 1984), 218–225. [pyramids]CrossRefGoogle Scholar
  39. 39.
    W. Burton, Representation of many-sided polygons and polygonal lines for rapid processing, Communications of the ACM 20, 3(March 1977), 166–171. [line data]MATHCrossRefGoogle Scholar
  40. 40.
    I. Carlbom, I. Chakravarty, and D. Vanderschel, A hierarchical data structure for representing the spatial decomposition of 3-D objects, IEEE Computer Graphics and Applications 5, 4(April 1985), 24–31. [three-dimensional data]CrossRefGoogle Scholar
  41. 41.
    W.E. Carlson, An algorithm and data structure for 3D object synthesis using surface patch intersections, Computer Graphics 16, 3(July 1982), 255–264 (also Proceedings of the SIGGRAPH’82 Conference, Boston, July 1982). [surface representation]CrossRefGoogle Scholar
  42. 42.
    C.H. Chien and J.K. Aggarwal, A normalized quadtree representation, Computer Vision, Graphics, and Image Processing 26, 3(June 1984), 331–346. [three-dimensional data]CrossRefGoogle Scholar
  43. 43.
    E. Cohen, T. Lyche, and R. Riesenfeld, Discrete B-splines and subdivision techniques in computer-aided geometric design and computer graphics, Computer Graphics and Image Processing 14, 3(October 1980), 87–111. [computer graphics]CrossRefGoogle Scholar
  44. 44.
    Y. Cohen, M.S. Landy, and M. Pavel, Hierarchical coding of binary images, IEEE Transactions on Pattern Analysis and Machine Intelligence 7, 3(May 1985), 284–298. [coding; approximation]CrossRefGoogle Scholar
  45. 45.
    D. Comer, The Ubiquitous B-tree, ACM Computing Surveys 11, 2(June 1979), 121–137. [point data]MATHCrossRefGoogle Scholar
  46. C.I. Connolly, Cumulative generation of octree models from range data, Proceedings of the International Conference on Robotics, Atlanta, March 1984, 25–32. [three-dimensional data]Google Scholar
  47. 47.
    B.G. Cook, 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, 1978. [region representation]Google Scholar
  48. 48.
    E. Creutzburg, Complexities of quadtrees and the structure of pictures, Friedrich-Schiller University Technical Report N/81/74, Jena, East Germany, 1981. [storage requirements]MATHGoogle Scholar
  49. 49.
    S.P. Dandamui and P.G. Sorenson, Performance of a modified k-tree, Department of Computational Science Report 84–10, University of Saskatchewan, Saskatoon, Canada, 1984. [point data]Google Scholar
  50. 50.
    S.P. Dandamui and P.G. Sorenson, Algorithms for the BD tree structure, Department of Computational Science Report 84–11, University of Saskatchewan, Saskatoon, Canada, 1984. [point data]Google Scholar
  51. 51.
    S.P. Dandamui and P.G. Sorenson, An empirical performance comparison of some variations of the k-d tree and BD tree, Department of Computational Science Report 84–13, University of Saskatchewan, Saskatoon, Canada, 1984. [point data]Google Scholar
  52. 52.
    E. Davis, Representing and acquiring geographic knowledge, Ph.D. dissertation, Department of Computer Science, Yale University, New Haven, Connecticut, 1984. [artificial intelligence; expert systems]Google Scholar
  53. 53.
    L.S. Davis and N. Roussopoulos, Approximate pattern matching in a pattern database system, Information Systems 5, 2(1980), 107–119. [image processing]MATHCrossRefGoogle Scholar
  54. 54.
    F. DeCoulon and U. Johnsen, Adaptive block schemes for source coding of black-and-white facsimile, Electronics Letters 12, 3(1976), 61–62 (see also erratum, Electronics Letters 12, 6(1976), 152). [coding; approximation]CrossRefGoogle Scholar
  55. 55.
    L. DeFloriani, B. Falcidieno, G. Nagy, and C. Pienovi, Yet another method for triangulation and contouring for automated cartography. Proceedings of the American Congress on Surveying and Mapping, American Society of Photogrammetry, F.S. Card well, R. Black, and B.M. Cole, Eds., Hollywood, Florida, 1982, 101–110. [surface representation]Google Scholar
  56. 56.
    R.A. DeMillo, S.C. Eisenstat, and R.J. Lipton, Preserving average proximity in arrays, Communications of the ACM 21, 3(March 1978), 228–231. [point data]CrossRefGoogle Scholar
  57. D. Dobkin and R.J. Lipton, Some generalizations of binary search, Proceedings of the Sixth SIGACT Symposium on Theory of Computing, Seattle, April 1974, 310–316. [point data]Google Scholar
  58. 58.
    D. Dobkin and R.J. Lipton, Multidimensional searching problems, SI AM Journal on Computing 5, 2(June 1976), 181–186. [point data]MathSciNetMATHCrossRefGoogle Scholar
  59. 59.
    L.J. Doctor and J.G. Torborg, Display techniques for octree-encoded objects, IEEE Computer Graphics and Applications 1, l(July 1981), 39–46. [region data]Google Scholar
  60. 60.
    L. Dorst and R.P.W. Duin, Spirograph theory: a framework for calculations on digitized straight lines, IEEE Transactions on Pattern Analysis and Machine Intelligence 6, 5(September 1984), 632–639. [line data; computer graphics; antialiasing]MATHCrossRefGoogle Scholar
  61. 61.
    L. Dorst and A.W.M. Smeulders, Discrete representation of straight lines, IEEE Transactions on Pattern Analysis and Machine Intelligence 6, 4(July 1984), 450–463. [line data; computer graphics; antialiasing]MATHCrossRefGoogle Scholar
  62. 62.
    R.O. Duda and P.E. Hart, Pattern Classification and Scene Analysis, Wiley Interscience, New York, 1973. [general]MATHGoogle Scholar
  63. 63.
    C.R. Dyer, Computing the Euler number of an image from its quadtree, Computer Graphics and Image Processing 13, 3(July 1980), 270–276. [region data]CrossRefGoogle Scholar
  64. 64.
    C.R. Dyer, A VLSI pyramid machine for parallel image processing, Proceedings of the IEEE Conference on Pattern Recognition and Image Processing, Dallas, 1981, 381–386. [hardware]Google Scholar
  65. 65.
    C.R. Dyer, The space efficiency of quadtrees, Computer Graphics and Image Processing 19, 4(August 1982), 335–348. [storage requirements]MATHCrossRefGoogle Scholar
  66. 66.
    C.R. Dyer, A. Rosenfeld, and H. Samet, Region representation: boundary codes from quadtrees, Communications of the ACM 23, 3(March 1980), 171–179. [region data]MATHCrossRefGoogle Scholar
  67. 67.
    C.M. Eastman, Representations for space planning, Communications of the ACM 13, 4(April 1970), 242–250. [region representation]CrossRefGoogle Scholar
  68. 68.
    C.M. Eastman, Optimal bucket size for nearest neighbor searching in k-d trees, Information Processing Letters 12, 4(August 1981), 165–167. [point data]MathSciNetCrossRefGoogle Scholar
  69. 69.
    C.M. Eastman and M. Zemankova, Partially specified nearest neighbor searches using k-d trees, Information Processing Letters 15, 2(September 1982), 53–56. [point data]MathSciNetCrossRefGoogle Scholar
  70. 70.
    H. Edelsbrunner, Key-problems and key-methods in computational geometry, Proceedings of the Symposium of Theoretical Aspects of Computer Science, Paris, 1984, 1–13 (Lecture Notes in Computer Science 166, Springer-Verlag, New York, 1984). [general]Google Scholar
  71. 71.
    H. Edelsbrunner, L.J. Guibas, and J. Stolfi, Optimal point location in a monotone subdivision, to appear in SIAM Journal on Computing, 1984. [line data]Google Scholar
  72. 72.
    H. Edelsbrunner and J. van Leeuwen, Multidimensional data structures and algorithms: a bibliography, Institute for Information Processing Report F104, Technical University of Graz, Graz, Austria, January 1983. [general]Google Scholar
  73. 73.
    R. Fagin, J. Nievergelt, N. Pippenger, and H.R. Strong, Extendible hashing - a fast access method for dynamic files, ACM Transactions on Database Systems 4, 3(September 1979), 315–344. [point data]CrossRefGoogle Scholar
  74. 74.
    O.D. Faugeras, M. Hebert, P. Mussi, and J.D. Boissonnat, Polyhedral approximation of 3-d objects without holes, Computer Vision, Graphics, and Image Processing 25, 2(February 1984), 169–183. [three-dimensional data]CrossRefGoogle Scholar
  75. 75.
    O. D. Faugeras and J. Ponce, Prism trees: a hierarchical representation for 3-d objects, Proceedings of the Eighth International Joint Conference on Artificial Intelligence, Karlsruhe, West Germany, August 1983, 982–988. [surface representation]Google Scholar
  76. 76.
    B. Faverjon, Obstacle avoidance using an octree in the configuration space of a manipulator, Proceedings of the International Conference on Robotics, Atlanta, March 1984, 504–512. [three-dimensional data; path planning]Google Scholar
  77. 77.
    R.A. Finkel and J.L. Bentley, Quad trees: a data structure for retrieval on composite keys, Acta Informatica 4, 1(1974), 1–9. [point data]MATHCrossRefGoogle Scholar
  78. P. Flajolet and C. Puech, Tree structures for partial match retrieval, Proceedings of the Twenty-fourth Annual IEEE Symposium on the Foundations of Computer Science, Tucson, November 1983, 282–288. [point data]Google Scholar
  79. 79.
    E. Fredkin, Trie memory, Communications of the ACM 3, 9(September 1960), 490–499. [point data]CrossRefGoogle Scholar
  80. 80.
    H. Freeman, Computer processing of line-drawing images, ACM Computing Surveys 6, l(March 1974), 57–97. [line data; region representation]MATHCrossRefGoogle Scholar
  81. 81.
    J.H. Friedman, F. Baskett, and L.J. Shustek, An algorithm for finding nearest neighbors, IEEE Transactions on Computers 24, 10(October 1975), 1000–1006. [point data]MATHCrossRefGoogle Scholar
  82. 82.
    J.H. Friedman, J.L. Bentley, and R.A. Finkel, An algorithm for finding best matches in logarithmic expected time, ACM Transactions on Mathematical Software 3, 3(September 1977), 209–226. [point data]MATHCrossRefGoogle Scholar
  83. 83.
    I. Gargantini, An effective way to represent quadtrees, Communications of the ACM 25, 12(December 1982), 905–910. [region representation]MATHCrossRefGoogle Scholar
  84. 84.
    I. Gargantini, Linear octtrees for fast processing of three dimensional objects, Computer Graphics and Image Processing 20, 4(December 1982), 365–374. [three-dimensional data]CrossRefGoogle Scholar
  85. 85.
    I. Gargantini, Detection of connectivity for regions represented by linear quadtrees, Computers arid Mathematics with Applications 8, 4(1982), 319–327. [geometric property measurement]MATHCrossRefGoogle Scholar
  86. 86.
    I. Gargantini, Translation, rotation, and superposition of linear quadtrees, International Journal of Man-Machine Studies 18, 3(March 1983), 253–263. [computer graphics]MATHCrossRefGoogle Scholar
  87. 87.
    P.C. Gaston and T. Lozano-Perez, Tactile recognition and localization using object models: the case of polyhedra on a plane, IEEE Transactions on Pattern Analysis and Machine Intelligence 6, 3(May 1984), 257–266. [three-dimensional datajCrossRefGoogle Scholar
  88. 88.
    L. Gibson and D. Lucas, Vectorization of raster images using hierarchical methods, Computer Graphics and Image Processing 20, 1 (September 1982), 82–89. [region representation]CrossRefGoogle Scholar
  89. 89.
    R. Gillespie and W.A. Davis, Tree data structures for graphics and image processing, Proceedings of the Seventh Conference of the Canadian Man-Computer Communications Society, Waterloo, Canada, June 1981, 155–161. [region representation]Google Scholar
  90. 90.
    A.S. Glassner, Space subdivision for fast ray tracing, IEEE Computer Graphics and Applications 4, 10(October 1984), 15–22. [ray tracing; computer graphics]Google Scholar
  91. 91.
    D. Gomez and A. Guzman, Digital model for three-dimensional surface representation, Geo-Processing, 1(1979), 53–70. [surface representation]Google Scholar
  92. 92.
    W.I. Grosky, M. Li, and R. Jain, A bottom-up approach to constructing quadtrees from binary arrays, Computer Science Report CSC-81-011, Wayne State University, Detroit, MI, 1981. [region data]Google Scholar
  93. 93.
    W.I. Grosky and R. Jain, iOptimal quadtrees for image segments, IEEE Transactions on Pattern Analysis and Machine Intelligence 5, 1 (January 1983), 77–83. [storage requirements]MATHCrossRefGoogle Scholar
  94. 94.
    B. Grunbaum and G.C. Shephard, The eighty-one types of isohedral tilings in the plane, Proceedings of the Cambridge Philosophical Society 82, (1977), 177–196. [region representation]MathSciNetCrossRefGoogle Scholar
  95. 95.
    H. Guting and H.P. Kriegel, Multidimensional B-tree: an efficient dynamic file structure for exact match queries, Informatik Fachberichte 33, (1980), 375–388. [point data]MathSciNetGoogle Scholar
  96. 96.
    H. Guting and H.P. Kriegel, Dynamic k-dimensional multi way search under time-varying access frequencies, Lecture Notes in Computer Science 104, (1981), 135–145. [point data]CrossRefGoogle Scholar
  97. 97.
    R.M. Haralick, Some neighborhood operations, in Real Time/Parallel Computing Image Analysis, M. Onoe, K. Preston, and A. Rosenfeld, Eds., Plenum Press, New York, NY, 1981. [geometric property measurement]Google Scholar
  98. 98.
    D.M. Hardas and S.N. Srihari, Progressive refinement of 3-d images using coded binary trees: algorithms and architecture, IEEE Transactions on Pattern Analysis and Machine Intelligence 6, 6(November 1984), 748–757. [coding; approximation]CrossRefGoogle Scholar
  99. 99.
    T.C. Henderson and E. Triendl, Storing feature descriptions as 2-d trees, Proceedings of Pattern Recognition and Image Processing 82, Las Vegas, Nevada, 1982, 555–556. [image processing]Google Scholar
  100. 100.
    K. Hinrichs and J. Nievergelt, The Grid File: a data structure to support proximity queries on spatial objects, Report 54, Institut fur Informatik, ETH, Zurich, July 1983. [point data]Google Scholar
  101. 101.
    D.S. Hirschberg, On the complexity of searching a set of vectors, SIAM Journal on Computing 9, l(February 1980), 126–129. [line data]MathSciNetMATHCrossRefGoogle Scholar
  102. 102.
    C.A.R. Hoare, Notes on data structuring, in Structured Programming, O.J. Dahl, E.W. Dijkstra, and C.A.R. Hoare, Eds., Academic Press, London, 1972, 154. [general]Google Scholar
  103. 103.
    S.L. Horowitz and T. Pavlidis, Picture segmentation by a tree traversal algorithm, Journal of the ACM 23, 2(April 1976), 368–388. [image processing]MATHCrossRefGoogle Scholar
  104. 104.
    M. Hoshi and T. Yuba, A counter example to a monotonicity property of k-d trees, Information Processing Letters 15, 4(October 1982), 169–173. [point data]MathSciNetMATHCrossRefGoogle Scholar
  105. 105.
    D.A. Huffman, A method for the construction of minimum-redundancy codes, Proceedings of the IRE 40, 9(September 1952), 1098–1101. [coding]CrossRefGoogle Scholar
  106. 106.
    G.M. Hunter, Efficient computation and data structures for graphics, Ph.D. dissertation, Department of Electrical Engineering and Computer Science, Princeton University, Princeton, NJ, 1978. [region representation; computer graphics]Google Scholar
  107. 107.
    G.M. Hunter and K. Steiglitz, Operations on images using quad trees, IEEE Transactions on Pattern Analysis and Machine Intelligence 1, 2 (April 1979), 145–153. [region representation; computer graphics]CrossRefGoogle Scholar
  108. 108.
    G.M. Hunter and K. Steiglitz, Linear transformation of pictures represented by quad trees, Computer Graphics and Image Processing 10, 3 (July 1979), 289–296. [region representation; computer graphics]CrossRefGoogle Scholar
  109. 109.
    H.A.H. Ibrahim, The connected component labeling algorithm on the NON-VON supercomputer, Proceedings of the Workshop on Computer Vision: Representation and Control, Annapolis, April 1984, 37–45. [hardware; geometric property measurement]Google Scholar
  110. 110.
    T. Ichikawa, A pyramidal representation of images and its feature extraction facility, IEEE Transactions on Pattern Analysis and Machine Intelligence 3, 3 (May 1981), 257–264. [region representation]MathSciNetCrossRefGoogle Scholar
  111. 111.
    M.G.B. Ismail and R. Steele, Adaptive pel location coding for bilevel facsimile signals, Electronics Letters 16, 10 (May 8, 1980), 361–363. [coding; approximation]CrossRefGoogle Scholar
  112. 112.
    C.L. Jackins and S.L. Tanimoto, Oct-trees and their use in representing three-dimensional objects, Computer Graphics and Image Processing 14, 3 (November 1980), 249–270. [three-dimensional data]CrossRefGoogle Scholar
  113. 113.
    C. Jackins and S.L. Tanimoto, Quad-trees, oct-trees, and k-trees-a generalized approach to recursive decomposition of Euclidean space, IEEE Transactions on Pattern Analysis and Machine Intelligence 5, 5 (September 1983), 533–539. [region representation]CrossRefGoogle Scholar
  114. 114.
    L. Jones and S.S. Iyengar, Space and time efficient virtual quadtrees, IEEE Transactions on Pattern Analysis and Machine Intelligence 6, 2 (March 1984), 244–247. [region representation]CrossRefGoogle Scholar
  115. 115.
    E. Kawaguchi and T. Endo, On a method of binary picture representation and its application to data compression, IEEE Transactions on Pattern Analysis and Machine Intelligence 2, 1 (January 1980), 27–35. [region representation]MATHCrossRefGoogle Scholar
  116. 116.
    E. Kawaguchi, T. Endo, and J. Matsunaga, Depth-first expression viewed from digital picture processing, IEEE Transactions on Pattern Analysis and Machine Intelligence 5, 4 (July 1983), 373–384. [region representation]CrossRefGoogle Scholar
  117. 117.
    E. Kawaguchi, T. Endo, and M. Yokota, DF-expression of binary-valued picture and its relation to other pyramidal representations, Proceedings of the Fifth International Conference on Pattern Recognition, Miami Beach, December 1980, 822–827. [region representation]Google Scholar
  118. 118.
    G. Kedem, The Quad-CIF tree: a data structure for hierarchical on-line algorithms, TR 91, Computer Science Department, The University of Rochester, Rochester, New York, September 1981. [rectangles]Google Scholar
  119. 119.
    M.D. Kelly, Edge detection in pictures by computer using planning, Machine Intelligence 6 (1971), 397–409. [image processing]Google Scholar
  120. 120.
    D. Kirkpatrick, Optimal search in planar subdivisions, SI AM Journal on Computing 12, 1 (February 1983), 28–35. [line data]MathSciNetMATHCrossRefGoogle Scholar
  121. 121.
    A. Klinger, Patterns and Search Statistics, in Optimizing Methods in Statistics, J.S. Rustagi, Ed., Academic Press, New York, 1971, 303–337. [region representation]Google Scholar
  122. 122.
    A. Klinger and C.R. Dyer, Experiments in picture representation using regular decomposition, Computer Graphics and Image Processing 5, 1 (March 1976), 68–105. [region representation]CrossRefGoogle Scholar
  123. 123.
    A. Klinger and M.L. Rhodes, Organization and access of image data by areas, IEEE Transactions on Pattern Analysis and Machine Intelligence 1, 1 (January 1979), 50–60. [region representation]CrossRefGoogle Scholar
  124. 124.
    G.D. Knott, Expandable open addressing hash table storage and retrieval, Proceedings of SIGFIDET Workshop on Data Description, Access, and Control, San Diego, November 1971, 187–206. [point data]CrossRefGoogle Scholar
  125. 125.
    K. Knowlton, Progressive transmission of grey-scale and binary pictures by simple, efficient, and lossless encoding schemes, Proceedings of the IEEE 68, 7 (July 1980) 885–896. [coding; approximation]CrossRefGoogle Scholar
  126. 126.
    D.E. Knuth, The Art of Computer Programming, vol. 3, Sorting and Searching, Addison-Wesley, Reading, MA, 1973. [general]Google Scholar
  127. 127.
    P. Koistinen, M. Tamminen, and H. Samet, Viewing solid models by bintree conversion, Proceedings of the EUROGRAPHICS’85 Conference, Nice, September 1985. [CSG; three-dimensional data]Google Scholar
  128. 128.
    T.L. Kunii, T. Satoh, and K. Yamaguchi, Generation of topological boundary representations from octree encoding, IEEE Computer Graphics and Applications 5, 3 (March 1985), 29–38. [three-dimensional data]CrossRefGoogle Scholar
  129. 129.
    J.P. Lauzon, D.M. Mark, L. Kikuchi, and J.A. Guevara, Two-dimensional run-encoding for quadtree representation, Computer Vision, Graphics, and Image Processing 30, l (April 1985), 56–69. [region representation]CrossRefGoogle Scholar
  130. 130.
    D.T. Lee and B.J. Shacter, Two algorithms for constructing a Delaunay triangulation, International Journal of Computer and Information Sciences 9, 3 (June 1980), 219–242. [point data]MathSciNetMATHCrossRefGoogle Scholar
  131. 131.
    D.T. Lee and C.K. Wong, Worst-case analysis for region and partial region searches in multidimensional binary search trees and quad trees, Acta Informatica 9, 1 (1977), 23–29. [point data]MathSciNetMATHCrossRefGoogle Scholar
  132. 132.
    D.T. Lee and C.K. Wong, Quintary trees: a file structure for multidimensional database systems, ACM Transactions on Database Systems 5, 4 (September 1980), 339–353. [point data]MATHCrossRefGoogle Scholar
  133. 133.
    P. Letelier, Transmission d’ images a’bas debit pour un systeme de communication telephonique adapte’ aux sourds, These de docteuringehieur, Université de Paris-Sud, Paris, September 1983. [region representation]Google Scholar
  134. 134.
    M. Li, W.I. Grosky, and R. Jain, Normalized quadtrees with respect to translations, Computer Graphics and Image Processing 20, 1 (September 1982), 72–81. [storage requirements]MATHCrossRefGoogle Scholar
  135. 135.
    J. Linn, General methods for parallel searching, Technical Report 81, Digital Systems Laboratory, Stanford University, Stanford, CA, May 1973. [point data]Google Scholar
  136. 136.
    R.J. Lipton and R.E. Tarjan, Application of a planar separator theorem, Proceedings of the Eighteenth Annual IEEE Symposium on the Foundations of Computer Science, Providence, October 1977, 162–170. [point data]Google Scholar
  137. 137.
    W. Litwin, Linear hashing: a new tool for file and table addressing, Proceedings of the Sixth International Conference on Very Large Data Bases, Montreal, October 1980, 212–223. [point data]Google Scholar
  138. 138.
    T. Lozano-Perez, Automatic planning of manipulator transfer movements, IEEE Transactions on Systems, Man, and Cybernetics 11, 10 (October 1981), 681–698. [three-dimensional data; path planning]CrossRefGoogle Scholar
  139. 139.
    G. Lueker, A data structure for orthogonal range queries, Proceedings 19th Symposium on Foundations of Computer Science, IEEE, October 1978, 28–34. [point data]Google Scholar
  140. 140.
    V.Y. Lum, Multi-attribute retrieval with combined indexes, Communications of the ACM 13, 11 (November 1970), 660–665. [point data]CrossRefGoogle Scholar
  141. 141.
    R. Lumia, L.Shapiro, and O. Zuniga, A new connected components algorithm for virtual memory computers, Computer Vision, Graphics, and Image Processing 22, 2 (May 1983), 287–300. [geometric property measurement]CrossRefGoogle Scholar
  142. 142.
    R. Lumia, A new three-dimensional connected components algorithm, Computer Vision, Graphics, and Image Processing 23, 2 (August 1983), 207–217. [geometric property measurement]CrossRefGoogle Scholar
  143. 143.
    E.M. McCreight, Priority search trees, SIAM Journal on Computing 14, 2 (May 1985), 257–276. [rectangles]MathSciNetMATHCrossRefGoogle Scholar
  144. 144.
    D.M. McKeown Jr. and J.L. Denlinger, Map-guided feature extraction from aerial imagery, Proceedings of the Workshop on Computer Vision: Representation and Control, Annapolis, April 1984, 205–213. [image processing]Google Scholar
  145. 145.
    D.M. Mark and D.J. Abel, Linear quadtrees from vector representations of polygons, IEEE Transactions on Pattern Analysis and Machine Intelligence 7, 3 (May 1984), 344–349. [region data]CrossRefGoogle Scholar
  146. 146.
    J.J. Martin, Organization of geographical data with quad trees and least square approximation, Proceedings of the IEEE Conference on Pattern Recognition and Image Procesbmg, Las Vegas, 1982, 458–463. [line data]Google Scholar
  147. 147.
    T. Matsuyama, L.V. Hao, and M. Nagao, A file organization for geographic information systems based on spatial proximity, Computer Vision, Graphics, and Image Processing 26, 3 (June 1984), 303–318. [region data]CrossRefGoogle Scholar
  148. 148.
    D. Meagher, Geometric modeling using octree encoding, Computer Graphics and Image Processing 19, 2 (June 1982), 129–147. [three-dimensional data]CrossRefGoogle Scholar
  149. 149.
    D. Meagher, The Solids engine: a processor for interactive solid modeling, Proceedings of the NICOGRAPH ’84 Conference, Tokyo, November 1984. [three-dimensional data]Google Scholar
  150. 150.
    K. Mehlhorn, Multi-dimensional Searching and Computational Geoemtry, Springer-Verlag, Berlin, 1984. [point data]Google Scholar
  151. 151.
    T.H. Merrett, Multidimensional paging for efficient database querying, Proceedings of the International Conference on Management of Data, Milan, June 1978, 277–289. [point data]Google Scholar
  152. 152.
    T.H. Merrett and E.J. Otoo, Dynamic multipaging: a storage structure for large shared data banks, in Improving Database Usability and Responsiveness, P. Scheuermann, Ed., Academic Press, New York, 1982, 237–254. [point data]Google Scholar
  153. 153.
    R.D. Merrill, Representations of contours and regions for efficient computer search, Communications of the ACM 16, 2 (February 1973), 69–82. [line data]MathSciNetCrossRefGoogle Scholar
  154. 154.
    D.J. Milford and P.C. Willis, Quad encoded display, IEE Proceedings 131, E3 (May 1984), 70–75. [hardware]Google Scholar
  155. 155.
    G.M. Morton, A computer oriented geodetic data base and a new technique in file sequencing, IBM Ltd., Ottawa, Canada, 1966. [region representation]Google Scholar
  156. 156.
    S.P. Mudur and P.A. Koparkar, Interval methods for processing geometric objects, IEEE Computer Graphics and Applications 4, 2 (February 1984), 7–17. [general]CrossRefGoogle Scholar
  157. 157.
    G. Nagy and S. Wagle, Geographic data processing, ACM Computing Surveys 11, 2 (June 1979), 139–181. [line data]CrossRefGoogle Scholar
  158. 158.
    J. Nievergelt, H. Hinterberger, and K.C. Sevcik, The Grid File: an adaptable, symmetric multikey file structure, ACM Transactions on Database Systems 9, 1 (March 1984), 38–71. [point data]CrossRefGoogle Scholar
  159. 159.
    J. Nievergelt and F.P. Preparata, Plane-sweep algorithms for intersecting geometric figures, Communications of the ACM 25, 10 (October 1982), 739–746. [line data]MATHCrossRefGoogle Scholar
  160. 160.
    N.J. Nilsson, A mobile automaton: an application of artificial intelligence techniques, Proceedings of the First International Joint Conference on Artificial Intelligence, Washington D.C., 1969, 509–520. [artificial intelligence]Google Scholar
  161. 161.
    M.A. Oliver, Two display algorithms for octrees, in Proceedings of the EURO-GRAPHICS’84 Conference, K. Bo and H.A. Tucker, Eds., North-Holland, 1984, 251–264. [three-dimensional data]Google Scholar
  162. 162.
    M.A. Oliver, T.R. King, and N.E. Wiseman, Quadtree scan conversion, in Proceedings of the EUROGRAPHICS’84 Conference, K. Bo and H.A. Tucker, Eds., North-Holland, 1984, 265–276. [region data]Google Scholar
  163. 163.
    M.A. Oliver and N.E. Wiseman, Operations on quadtree-encoded images, Computer Journal 26, l(February 1983), 83–91. [region representation]CrossRefGoogle Scholar
  164. 164.
    M.A. Oliver and N.E. Wiseman, Operations on quadtree leaves and related image areas, Computer Journal 26, 4(November 1983), 375–380. [region representation]MATHGoogle Scholar
  165. 165.
    J.O. Omolayole and A. Klinger, A hierarchical data structure scheme for storing pictures, in Pictorial Information Systems, S.K. Chang and K.S. Fu, Eds., Springer-Verlag, 1980. [region representation]Google Scholar
  166. 166.
    J.A. Orenstein, Multidimensional tries used for associative searching, Information Processing Letters 14, 4(June 1982), 150–157. [point data]CrossRefGoogle Scholar
  167. 167.
    J.A. Orenstein, A dynamic hash file for random and sequential accessing, Proceedings of the Sixth International Conference on Very Large Data Bases, Florence, October 1983, 132–141. [point data]Google Scholar
  168. 168.
    J.A. Orenstein and T.H. Merrett, A class of data structures for associative searching, Proceedings of the Third ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, Waterloo, April 1984, 181–190. [point data]Google Scholar
  169. 169.
    J. O’Rourke, Dynamically quantized spaces for focusing the Hough Transform, Proceedings of the Sixth International Joint Conference on Artificial Intelligence, Vancouver, August 1981, 737–739. [point data]Google Scholar
  170. 170.
    J. O’Rourke and K.R. Sloan Jr., Dynamic quantization: two adaptive data structures for multidimensional squares, IEEE Transactions on Pattern Analysis and Machine Intelligence 6, 3(May 1984), 266–280. [point data]CrossRefGoogle Scholar
  171. 171.
    T. Ottmann and D. Wood, 1–2 brother trees or AVL trees revisited, The Computer Journal 23, 3(August 1980), 248–255. [point data]MathSciNetMATHGoogle Scholar
  172. 172.
    M. Ouksel and P. Scheuermann, Storage mappings for multidimensional linear dynamic hashing, Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, Atlanta, March 1983, 90–105. [point data]Google Scholar
  173. 173.
    M.H. Overmars, The Design of Dynamic Data Structures, Lecture Notes in Computer Science 156, Springer-Verlag, New York, 1983. [point data]Google Scholar
  174. 174.
    M.H. Overmars and J. van Leeuwen, Dynamic multi-dimensional data structures based on quad- and k-d trees, Acta Informatica 17, 3(1982), 267–285. [point data]MathSciNetMATHCrossRefGoogle Scholar
  175. 175.
    C.M. Park and A. Rosenfeld, Connectivity and genus in three dimensions, Computer Science TR-156, University of Maryland, College Park, MD, May 1971. [geometric property measurement]Google Scholar
  176. 176.
    F. Peters, An algorithm for transformations of pictures represented by quadtrees, to appear in Computer Vision, Graphics, and Image Processing (also Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands, 1984). [region representation; computer graphics]Google Scholar
  177. 177.
    T. Peucker, A theory of the cartographic line, International Yearbook of Cartography 16, 1976, 134–143. [line data]Google Scholar
  178. 178.
    D.J. Peuquet, Raster processing: an alternative approach to automated cartographic data handling, American Cartographer 6 2(April 1979), 129–139. [region data]CrossRefGoogle Scholar
  179. 179.
    D.J. Peuquet, A hybrid data structure for the storage and manipulation of very large spatial data sets, Computer Vision, Graphics, and Image Processing 24, (October 1983), 14–27. [region data]CrossRefGoogle Scholar
  180. 180.
    J.L. Pfaltz and A. Rosenfeld, Computer representation of planar regions by their skeletons, Communications of the ACM 10, 3(February 1967), 119–122. [medial axis transforms]CrossRefGoogle Scholar
  181. 181.
    M. Pietikainen, A. Rosenfeld, and I. Walter, Split-and-link algorithms for image segmentation, Pattern Recognition 15, 4(1982), 287–298. [pyramids]CrossRefGoogle Scholar
  182. 182.
    C. Puech and H. Yahia, Quadtrees, octrees, hyperoctrees: a unified analytical approach to tree data structures used in graphics, geometric modeling, and image processing, Proceedings of the Symposium on Computational Geometry, Baltimore, June 1985, 272–280. [region data]Google Scholar
  183. 183.
    V.V. Raghvan and C.T. Yu, A note on a multidimensional searching problem, Information Processing Letters 6, 4(August 1977), 133–135. [point data]CrossRefGoogle Scholar
  184. 184.
    V. Raman and S.S. Iyengar, Properties and applications of forests of quadtrees for pictorial data representation, BIT 23, 4(1983), 472–486. [region data]MATHCrossRefGoogle Scholar
  185. 185.
    S. Ranade, Use of quadtrees for edge enhancement, IEEE Transactions on Systems, Man, and Cybernetics 11, 5(May 1981), 370–373. [image processing]CrossRefGoogle Scholar
  186. 186.
    S. Ranade, A. Rosenfeld, and J.M.S. Prewitt, Use of quadtrees for image segmentation, Computer Science TR-878, University of Maryland, College Park, MD, February 1980. [image processing]Google Scholar
  187. 187.
    S. Ranade, A. Rosenfeld, and H. Samet, Shape approximation using quadtrees, Pattern Recognition 25, 1(1982), 31–40. [image processing]CrossRefGoogle Scholar
  188. 188.
    S. Ranade and M. Shneier, Using quadtrees to smooth images, IEEE Transactions on Systems, Man, and Cybernetics 11, 5(May 1981), 373–376. [image processing]CrossRefGoogle Scholar
  189. 189.
    D.R. Reddy and S. Rubin, Representation of three-dimensional objects, CMU-CS-78–113, Computer Science Department, Carnegie-Mellon University, Pittsburgh, April 1978. [three-dimensional data]Google Scholar
  190. 190.
    E.M. Reingold and R.E. Tarjan, On the greedy heuristic for complete matching, SIAM Journal on Computing 10, 4(November 1981), 676–681. [point data; Euclidean matching]MathSciNetMATHCrossRefGoogle Scholar
  191. 191.
    A.A.G. Requicha, Representations of rigid solids: theory, methods, and systems, ACM Computing Surveys 12, 4(December 1980), 437–464. [three-dimensional data]CrossRefGoogle Scholar
  192. 192.
    W.C. Rheinboldt and C.K. Mesztenyi, On a data structure for adaptive finite element mesh refinements, ACM Transactions on Mathematical Software 6, 2(June 1980), 166–187. [numerical analysis]MATHCrossRefGoogle Scholar
  193. 193.
    E.M. Riseman and M.A. Arbib, Computational techniques in the visual segmentation of static scenes, Computer Graphics and Image Processing 6, 3(June 1977), 221–276. [image processing]CrossRefGoogle Scholar
  194. 194.
    J.T. Robinson, The k-d-B-tree: a search structure for large multidimensional dynamic indexes, Proceedings of the SIGMOD Conference, Ann Arbor, Michigan, April 1981, 10–18. [point data]Google Scholar
  195. 195.
    J.B. Rosenberg, Geographical data structures compared: a study of data structures supporting region queries, IEEE Transactions on Computer-Aided Design 4, 1 (January 1985), 53–67. [rectangles]CrossRefGoogle Scholar
  196. 196.
    A. Rosenfeld, Ed., Multiresolution Image Processing and Analysis, Springer-Verlag, Berlin, 1983. [general]Google Scholar
  197. 197.
    Rosenfeld, A., Picture processing 1984, Computer Vision, Graphics, and Image Processing 26, 3(June 1984), 347–384. [general]MathSciNetCrossRefGoogle Scholar
  198. 198.
    A. Rosenfeld and A.C. Kak, Digital Picture Processing, Second Edition, Academic Press, New York, 1982. [general]Google Scholar
  199. 199.
    A. Rosenfeld and J.L. Pfaltz, Sequential operations in digital image processing, Journal of the ACM 13, 4(October 1966), 471–494. [image processing]MATHCrossRefGoogle Scholar
  200. 200.
    A. Rosenfeld, H. Samet, C. Shaffer, and R.E. Webber, Application of hierarchical data structures to geographical information systems, Computer Science TR-1197, University of Maryland, College Park, MD, June 1982. [geographic information systems]Google Scholar
  201. 201.
    A. Rosenfeld, H. Samet, C. Shaffer, and R.E. Webber, Application of hierarchical data structures to geographical information systems phase II, Computer Science TR 1327, University of Maryland, College Park, MD, September 1983. [geographic information systems]Google Scholar
  202. 202.
    S.D. Roth, Ray casting for modeling solids, Computer Graphics and Image Processing 18, 2(February 1982), 109–144. [computer graphics]CrossRefGoogle Scholar
  203. 203.
    D. Rutovitz, Data structures for operations on digital images, in Pictorial Pattern Recognition, G.C. Cheng et al., Eds., Thompson Book Co., Washington D.C., 1968, 105–133. [region representation]Google Scholar
  204. 204.
    H. Samet, Region representation: quadtrees from boundary codes, Communications of the ACM 23, 3(March 1980), 163–170. [region data]MATHCrossRefGoogle Scholar
  205. 205.
    H. Samet, Region representation: quadtrees from binary arrays, Computer Graphics and Image Processing 13, l(May 1980), 88–93. [region data]CrossRefGoogle Scholar
  206. 206.
    H. Samet, Deletion in two-dimensional quad trees, Communications of the ACM 23, 12(December 1980), 703–710. [point data]CrossRefGoogle Scholar
  207. 207.
    H. Samet, An algorithm for converting rasters to quadtrees, IEEE Transactions on Pattern Analysis and Machine Intelligence 3, 1 (January 1981), 93–95. [region data]CrossRefGoogle Scholar
  208. 208.
    H. Samet, Connected component labeling using quadtrees, Journal of the ACM 28, 3(July 1981), 487–501. [geometric property measurement]MathSciNetMATHCrossRefGoogle Scholar
  209. 209.
    H. Samet, Computing perimeters of images represented by quadtrees, IEEE Transactions on Pattern Analysis and Machine Intelligence 3, 6(November 1981), 683–687. [geometric property measurement]CrossRefGoogle Scholar
  210. 210.
    H. Samet, Neighbor finding techniques for images represented by quadtrees, Computer Graphics and Image Processing 18, 1 (January 1982), 37–57. [region data]MATHCrossRefGoogle Scholar
  211. 211.
    H. Samet, Distance transform for images represented by quadtrees, IEEE Transactions on Pattern Analysis and Machine Intelligence 4, 3(May 1982), 298–303. [medial axis transforms]CrossRefGoogle Scholar
  212. 212.
    H. Samet, A quadtree medial axis transform, Communications of the ACM 26, 9(September 1983), 680–693 (see also corrigendum, Communications of the ACM 27, 2(February 1984), 151). [medial axis transforms]CrossRefGoogle Scholar
  213. 213.
    H. Samet, Algorithms for the conversion of quadtrees to rasters, Computer Vision, Graphics, and Image Processing 26, 1(April 1984), 1–16. [region data]MathSciNetCrossRefGoogle Scholar
  214. 214.
    H. Samet, The quadtree and related hierarchical data structures, ACM Computing Surveys 16, 2(June 1984), 187–260. [general]MathSciNetCrossRefGoogle Scholar
  215. 215.
    H. Samet, A top-down quadtree traversal algorithm, IEEE Transactions on Pattern Analysis and Machine Intelligence 7, 1 (January 1985), 94–98 (also University of Maryland Computer Science TR-1237). [region data]CrossRefGoogle Scholar
  216. 216.
    H. Samet, Reconstruction of quadtrees from quadtree medial axis transforms, Computer Vision, Graphics, and Image Processing 29, 3(March 1985), 311–328 (also University of Maryland Computer Science TR-1224). [medial axis transforms]CrossRefGoogle Scholar
  217. 217.
    H. Samet, Data structures for quadtree approximation and compression, Communications of the ACM 28, 9(September 1985), 973–993 (also University of Maryland Computer Science TR-1209). [coding; approximation]CrossRefGoogle Scholar
  218. 218.
    H. Samet and A. Rosenfeld, Quadtree structures for image processing, Proceedings of the Fifth International Conference on Pattern Recognition, Miami Beach, December 1980, 815–818. [region data]Google Scholar
  219. 219.
    H. Samet, A. Rosenfeld, C. Shaffer, and R.E. Webber, Quadtree region representation in cartography: experimental results, IEEE Transactions on Systems, Man, and Cybernetics 13, 6(November/December 1983), pp. 1148–1154. [geographic information systems]Google Scholar
  220. 220.
    H. Samet, A. Rosenfeld, C. Shaffer, and R.E. Webber, A geographic information system using quadtrees, Pattern Recognition 17, 6(November/December 1984), 647–656. [geographic information systems]CrossRefGoogle Scholar
  221. 221.
    H. Samet, A. Rosenfeld, C.A. Shaffer, R.C. Nelson, and Y.G. Huang, Application of hierarchical data structures to geographical information systems Phase III, Computer Science TR 1457, University of Maryland, College Park, MD, November 1984. [geographic information systems]Google Scholar
  222. 222.
    H. Samet and C.A. Shaffer, A model for the analysis of neighbor finding in pointer-based quadtrees, IEEE Transactions on Pattern Analysis and Machine Intelligence 7, 6(November 1985) (also University of Maryland Computer Science TR-1432). [region data]Google Scholar
  223. 223.
    H. Samet, C.A. Shaffer, and R.E. Webber, The segment quadtree: a linear quadtreebased representation for linear features, Proceedings of Computer Vision and Pattern Recognition 85, San Francisco, June 1985, 385–389. [line data]Google Scholar
  224. 224.
    H. Samet and M. Tamminen, Efficient component labeling of images of arbitrary dimension, Computer Science TR-1480, University of Maryland, College Park, MD, February 1985 (subsumes TR-1420). [geometric property measurement]Google Scholar
  225. 225.
    H. Samet and M. Tamminen, Computing geometric properties of images represented by linear quadtrees, IEEE Transactions on Pattern Analysis and Machine Intelligence 7, 2(March 1985), 229–240 (also University of Maryland Computer Science TR 1359). [geometric property measurement]CrossRefGoogle Scholar
  226. 226.
    H. Samet and M. Tamminen, Bintrees, CSG trees, and time, Computer Graphics 19, 3(July 1985), pp. 121–130 (also Proceedings of the SIGGRAPH’85 Conference, San Francisco, July 1985 and University of Maryland Computer Science TR-1472). [three-dimensional data]CrossRefGoogle Scholar
  227. 227.
    H. Samet and R.E. Webber, On encoding boundaries with quadtrees, Computer Science TR-1162, University of Maryland, College Park, MD, February 1982. [line data]Google Scholar
  228. 228.
    H. Samet and R. E. Webber, Using quadtrees to represent polygonal maps, Proceedings of Computer Vision and Pattern Recognition 83, Washington, DC, June 1983, 127–132. [line data]Google Scholar
  229. 229.
    H. Samet and R.E. Webber, On encoding boundaries with quadtrees, IEEE Transactions on Pattern Analysis and Machine Intelligence 6, 3(May 1984), 365–369. [line data]CrossRefGoogle Scholar
  230. 230.
    H. Samet and R.E. Webber, Storing a collection of polygons using quadtrees, to appear in ACM Transactions on Graphics (also University of Maryland Computer Science TR-1372). [line data]Google Scholar
  231. 231.
    J.B. Saxe, On the number of range queries in k-space, Discrete Applied Math I, 3(1979), 217–225. [point data]MathSciNetCrossRefGoogle Scholar
  232. 232.
    D.S. Scott and S.S. Iyengar, A new data structure for efficient storing of images, Pattern Recognition Letters 3, 3(May 1985), 211–214. [region representation]CrossRefGoogle Scholar
  233. 233.
    M.I. Shamos, Computational geometry, Ph.D. dissertation, Department of Computer Science, Yale University, New Haven, Connecticut, 1978. [point data]Google Scholar
  234. 234.
    M.I. Shamos and D. Hoey, Closest-point problems, Proceedings of the Sixteenth Annual IEEE Symposium on the Foundations of Computer Science, Berkeley, October 1975, 151–162. [point data]Google Scholar
  235. 235.
    M. Shneier, Path-length distances for quadtrees, Information Sciences 23, l(February 1981), 49–67. [region data]MathSciNetMATHCrossRefGoogle Scholar
  236. 236.
    M. Shneier, Calculations of geometric properties using quadtrees, Computer Graphics and Image Processing 16, 3(July 1981), 296–302. [region data]CrossRefGoogle Scholar
  237. 237.
    M. Shneier, Two hierarchical linear feature representations: edge pyramids and edge quadtrees, Computer Graphics and Image Processing 17, 3(November 1981), 211–224. [line data]CrossRefGoogle Scholar
  238. 238.
    Y.V. Silva Filho, Average case analysis of region search in balanced k-d trees, Information Processing Letters 8, 5(June 1979), 219–223. [point data]MathSciNetMATHCrossRefGoogle Scholar
  239. 239.
    Y.V. Silva Filho, Optimal choice of discriminators in a balanced k-d binary search tree, Information Processing Letters 13, 2(November 1981), 67–70. [point data]MathSciNetMATHCrossRefGoogle Scholar
  240. 240.
    K.R. Sloan Jr., Dynamically quantized pyramids, Proceedings of the Sixth International Joint Conference on Artificial Intelligence, Vancouver, August 1981, 734–736. [point data]Google Scholar
  241. 241.
    K.R. Sloan Jr. and S.L. Tanimoto, Progressive refinement of raster images, IEEE Transactions on Computers 28, 11 (November 1979), 871–874. [coding; approximation]CrossRefGoogle Scholar
  242. 242.
    N. Solntseff and D. Wood, Pyramids: A data type for matrix representation in PASCAL, BIT 17, (1977), 344–350. [point data; matrix representation]MATHCrossRefGoogle Scholar
  243. 243.
    S.N. Srihari, Representation of three-dimensional digital images, ACM Computing Surveys 13, l(December 1981), 399–424. [three-dimensional data]CrossRefGoogle Scholar
  244. 244.
    Q. Stout, Linear-time component labeling and distance transforms in quadtrees, University of Michigan, Ann Arbor, 1985. [geometric property measurement]Google Scholar
  245. 245.
    I.E. Sutherland, R.F. Sproull, and R.A. Schumacker, A characterization of ten hidden-surface algorithms, ACM Computing Surveys 6, 1 (March 1974), 1–55. [computer graphics]MATHCrossRefGoogle Scholar
  246. 246.
    M. Tamminen, The EXCELL method for efficient geometric access to data, Acta Polytechnica Scandinavica, Mathematics and Computer Science Series No. 34, Helsinki, 1981. [point data]Google Scholar
  247. 247.
    M. Tamminen, Hidden lines using the EXCELL method, Computer Graphics Forum 11, No. 3, 1982, 96–105. [computer graphics]CrossRefGoogle Scholar
  248. 248.
    M. Tamminen, Performance analysis of cell based geometric file organizations, Computer Vision, Graphics, and Image Processing 24, 2(November 1983), 168–181. [region data]CrossRefGoogle Scholar
  249. 249.
    M. Tamminen, Comment on quad- and octtrees, Communications of the ACM 27, 3(March 1984), 248–249. [region data]CrossRefGoogle Scholar
  250. 250.
    M. Tamminen, Encoding pixel trees, Computer Vision, Graphics, and Image Processing 28, 1(October 1984), 44–57. [region data]CrossRefGoogle Scholar
  251. 251.
    M. Tamminen and H. Samet, Efficient octree conversion by connectivity labeling, Computer Graphics 18, 3(July 1984), pp. 43–51 (also Proceedings of the SIGGRAPH’84 Conference, Minneapolis, July 1984). [three-dimensional data]CrossRefGoogle Scholar
  252. 252.
    S. Tanimoto, Pictorial feature distortion in a pyramid, Computer Graphics and Image Processing 5, 3(September 1976), 333–352. [pyramids]CrossRefGoogle Scholar
  253. 253.
    S.L. Tanimoto, Image transmission with gross information first, Computer Graphics and Image Processing 9, 1 (January 1979), 72–76. [coding; approximation]CrossRefGoogle Scholar
  254. 254.
    S. Tanimoto and A. Klinger, Eds., Structured Computer Vision, Academic Press, New York, 1980. [general]Google Scholar
  255. 255.
    S. Tanimoto and T. Pavlidis, A hierarchical data structure for picture processing, Computer Graphics and Image Processing 4, 2(June 1975), 104–119. [image processing]CrossRefGoogle Scholar
  256. 256.
    G.T. Toussaint, Pattern recognition and geometrical complexity, Proceedings of the Fifth International Conference on Pattern Recognition, Miami Beach, December 1980, 1324–1346. [general]Google Scholar
  257. 257.
    H. Tropf and H. Herzog, Multidimensional range search in dynamically balanced trees, Angewandte Informatik, 2(1981), 71–77. [point data]Google Scholar
  258. 258.
    L.W. Tucker, Control strategy for an expert vision system using quadtree refinement, Proceedings of the Workshop on Computer Vision: Representation and Control, Annapolis, April 1984, 214–218. [image processing]Google Scholar
  259. 259.
    L.W. Tucker, Computer vision using quadtree refinement, Ph.D. dissertation, Department of Electrical Engineering and Computer Science, Polytechnic Institute of New York, Brooklyn, NY, May 1984. [image processing]Google Scholar
  260. 260.
    L. Uhr, Layered “recognition cone” networks that preprocess, classify, and describe, IEEE Transactions on Computers 21, 7(July 1972), 758–768. [pyramids]MATHCrossRefGoogle Scholar
  261. 261.
    A. Unnikrishnan and Y.V. Venkatesh, On the conversion of raster to linear quadtrees, Department of Electrical Engineering, Indian Institute of Science, Bangalore, India, May 1984. [region data]Google Scholar
  262. 262.
    V.K. Vaishnavi, Multidimensional height-balanced trees, IEEE Transactions on Computers 33, 4(April 1984), 334–343. [point data]MATHCrossRefGoogle Scholar
  263. 263.
    V.K. Vaishnavi, H.P. Kriegel, and D. Wood, Space and time optimal algorithms for a class of rectangle intersection problems, Information Sciences 21, (1980), 59–67. [point data]MATHCrossRefGoogle Scholar
  264. 264.
    V. Vaishnavi and D. Wood, Data structures for the rectangle containment and enclosure problems, Computer Graphics and Image Processing 13, (1980) 372–384. [point data]CrossRefGoogle Scholar
  265. 265.
    J. van Leeuwen and D. Wood, The measure problem for rectangular ranges in d-space, Journal of Algorithms 2, 3(September 1981), 282–300. [rectangles]MathSciNetMATHCrossRefGoogle Scholar
  266. 266.
    M.L.P. van Lierop, Transformations on pictures represented by leafcodes, Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands, 1984. [region representation; computer graphics]Google Scholar
  267. 267.
    J. Veenstra and N. Ahuja, Octree generation from silhouette views of an object, Proceedings of the International Conference on Robotics, St. Louis, March 1985, 843–848. [three-dimensional data]Google Scholar
  268. 268.
    J.L. Warnock, A hidden surface algorithm for computer generated half tone pictures, Computer Science Department TR 4–15, University of Utah, Salt Lake City, June 1969. [computer graphics]Google Scholar
  269. 269.
    R.E. Webber, Analysis of quadtree algorithms, Ph.D. dissertation, Computer Science Department, University of Maryland, College Park, MD, March 1984 (also University of Maryland Computer Science TR-1376). [general]Google Scholar
  270. 270.
    W. Weber, Three types of map data structures, their ANDs and NOTs, and a possible OR, 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, 1978. [region representation]Google Scholar
  271. 271.
    M. White, N-trees: large ordered indexes for multi-dimensional space, U.S. Bureau of the Census, Statistical Research Division, 1982. [point data]Google Scholar
  272. 272.
    D.E. Willard, Balanced forests of #roman {k-d sup ∗# trees as a dynamic data structure, Aiken Computation Lab TR-23–78, Harvard University, Cambridge, 1978. [point data]Google Scholar
  273. 273.
    D.E. Willard, Polygon retrieval, SI AM Journal on Computing 11, 1 (February 1982), 149–165. [point data]MathSciNetMATHCrossRefGoogle Scholar
  274. 274.
    D.E. Willard, New data structures for orthogonal range queries, SI AM Journal on Computing 14, l(February 1982), 232–253. [point data]MathSciNetGoogle Scholar
  275. 275.
    D.S. Wise, Representing matrices as quadtrees for parallel processors, Information Processing Letters 20, 4(May 1985), 195–199. [numerical analysis]MathSciNetCrossRefGoogle Scholar
  276. 276.
    E.K. Wong and K.S. Fu, A hierarchical-orthogonal-space approach to collision-free path planning, Proceedings of the International Conference on Robotics, St. Louis, March 1985, 506–511. [three-dimensional data, path planning]Google Scholar
  277. 277.
    T.C. Woo, A combinatorial analysis of boundary data structure schemata, IEEE Computer Graphics and Applications 5, 3(March 1985), 19–27. [three-dimensional data]MathSciNetCrossRefGoogle Scholar
  278. 278.
    J.R. Woodwark, The explicit quad tree as a structure for computer graphics, Computer Journal 25, 2(May 1982), 235–238. [region representation]CrossRefGoogle Scholar
  279. 279.
    J.R. Woodwark, Compressed quad trees, Computer Journal 27, 3(August 1984), 225–229. [region representation]CrossRefGoogle Scholar
  280. 280.
    A.Y. Wu, T.H. Hong, and A. Rosenfeld, Threshold selection using quadtrees, IEEE Transactions on Pattern Analysis and Machine Intelligence 4, 1 (January 1982), 90–94. [image processing]MATHCrossRefGoogle Scholar
  281. 281.
    K. Yamaguchi, T.L. Kunii, K. Fujimura, and H. Toriya, Octree-related data structures and algorithms, IEEE Computer Graphics and Applications 4, 1 (January 1984), 53–59. [three-dimensional data]CrossRefGoogle Scholar
  282. 282.
    M. Yau, Generating quadtrees of cross-sections from octrees, Computer Vision, Graphics, and Image Processing 27, 2(August 1984), 211–238. [three-dimensional data]CrossRefGoogle Scholar
  283. 283.
    M. Yau and S.N. Srihari, A hierarchical data structure for multidimensional digital images, Communications of the ACM 26, 7(July 1983), 504–515. [three-dimensional data]CrossRefGoogle Scholar
  284. 284.
    M.A. Yerry and M.S. Shepard, A modified quadtree approach to finite element mesh generation, IEEE Computer Graphics and Applications 3, 1(January/February 1983), 39–46. [numerical analysis]CrossRefGoogle Scholar

Copyright information

© EUROGRAPHICS The European Association for Computer Graphics 1986

Authors and Affiliations

  • Hanan Samet
    • 1
  1. 1.Computer Science DepartmentUniversity of MarylandCollege ParkUSA

Personalised recommendations