The DOI matches its Crossref record; 67 of the 67 references it cites were found in a registry or an index.
The Quadtree and Related Hierarchical Data Structures
Abstract
A tutorial survey is presented of the quadtree and related hierarchical data structures. They are based on the principle of recursive decomposition. The emphasis is on the representation of data used in applications in image processing, computer graphics, geographic information systems, and robotics. There is a greater emphasis on region data (i.e., two-dimensional shapes) and to a lesser extent on point, curvilinear, and threedimensional data. A number of operations in which such data structures find use are examined in greater detail.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Harary, F. (1969) · Cited by 10,739
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Multidimensional binary search trees used for associative searching
Bentley, J. L. (1975) · Communications of the ACM · doi:10.1145/361002.361007 · Cited by 7,520
A Method for the Construction of Minimum-Redundancy Codes
Huffman, D. (1952) · Proceedings of the IRE · doi:10.1109/jrproc.1952.273898 · Cited by 6,334
Proceedings of the 19th International Joint Conference on Artificial Intelligence
Pujol, J. M., Delgado, J., Ramon Sangüesa, A., & Flache, A. (2005) · International Joint Conference on Artificial Intelligence · Cited by 5,771
Perceptrons: An Introduction to Computational Geometry
Minsky, M., & Papert, S. A. (1969) · Cited by 3,720
An Algorithm for Finding Best Matches in Logarithmic Expected Time
Friedman, J. H., Bentley, J. L., & Finkel, R. A. (1977) · ACM Transactions on Mathematical Software · doi:10.1145/355744.355745 · Cited by 2,813
The Art of Computer Programming
Worlton, W. J. (1968) · Nuclear Science and Engineering · doi:10.13182/nse68-a19548 · Cited by 2,251
Quad trees a data structure for retrieval on composite keys
Finkel, R. A., & Bentley, J. L. (1974) · Acta Informatica · doi:10.1007/bf00288933 · Cited by 2,041
Comer, D. (1979) · ACM Computing Surveys · doi:10.1145/356770.356776 · Cited by 1,859
A transformation for extracting new descriptors of shape
Blum, H. E. (1967) · Medical Entomology and Zoology · Cited by 1,753
Knuth, D. E. (1973) · Cumulative Index of Computer Aided Architectural Design · Cited by 1,719
Sequential Operations in Digital Picture Processing
Rosenfeld, A., & Pfaltz, J. L. (1966) · Journal of the ACM · doi:10.1145/321356.321357 · Cited by 1,675
Two algorithms for constructing a Delaunay triangulation
Lee, D. T., & Schachter, B. J. (1980) · International Journal of Computer & Information Sciences · doi:10.1007/bf00977785 · Cited by 1,584
Representations for Rigid Solids: Theory, Methods, and Systems
Requicha, A. G. (1980) · ACM Computing Surveys · doi:10.1145/356827.356833 · Cited by 1,436
Efficiency of a Good But Not Linear Set Union Algorithm
Tarjan, R. E. (1975) · Journal of the ACM · doi:10.1145/321879.321884 · Cited by 1,403
Computer Processing of Line-Drawing Images
Freeman, H. (1974) · ACM Computing Surveys · doi:10.1145/356625.356627 · Cited by 1,368
Geometric modeling using octree encoding
Meagher, D. (1982) · Computer Graphics and Image Processing · doi:10.1016/0146-664x(82)90104-6 · Cited by 1,266
Models for the perception of speech and visual form
Brubaker, R. S. (1968) · Journal of Communication Disorders · doi:10.1016/0021-9924(68)90015-4 · Cited by 1,254
Fredkin, E. (1960) · Communications of the ACM · doi:10.1145/367390.367400 · Cited by 1,090
Shamos, M. I., & Hoey, D. (1975) · 16th Annual Symposium on Foundations of Computer Science (sfcs 1975) · doi:10.1109/sfcs.1975.8 · Cited by 1,057
Pattern Classification and Scene Analysis.
Grenander, U., Duda, R. O., & Hart, P. E. (1974) · Journal of the American Statistical Association · doi:10.2307/2286028 · Cited by 1,006
A Convergence Theorem for the Fuzzy ISODATA Clustering Algorithms
Bezdek, J. C. (1980) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1980.4766964 · Cited by 980
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
Robinson, J. T. (1981) · Proceedings of the 1981 ACM SIGMOD international conference on Management of data - SIGMOD '81 · doi:10.1145/582318.582321 · Cited by 888
A Characterization of Ten Hidden-Surface Algorithms
Sutherland, I. E., Sproull, R. F., & Schumacker, R. A. (1974) · ACM Computing Surveys · doi:10.1145/356625.356626 · Cited by 861
Optimal Search in Planar Subdivisions
Kirkpatrick, D. (1983) · SIAM Journal on Computing · doi:10.1137/0212002 · Cited by 739
Automatic Planning of Manipulator Transfer Movements
Lozano-Perez, T. (1981) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1981.4308589 · Cited by 692
Multiresolution Image Processing and Analysis
Rosenfeld, A. (1984) · Springer series in information sciences · doi:10.1007/978-3-642-51590-3 · Cited by 662
Extendible hashing—a fast access method for dynamic files
Fagin, R., Nievergelt, J., Pippenger, N., & Strong, H. R. (1979) · ACM Transactions on Database Systems · doi:10.1145/320083.320092 · Cited by 659
Data Structures for Range Searching
Bentley, J. L., & Friedman, J. H. (1979) · ACM Computing Surveys · doi:10.1145/356789.356797 · Cited by 622
Ray casting for modeling solids
Roth, S. D. (1982) · Computer Graphics and Image Processing · doi:10.1016/0146-664x(82)90169-1 · Cited by 606
A Mobile Automaton: An Application of Artificial Intelligence Techniques
Nilsson, N. J. (1969) · doi:10.21236/ada459660 · Cited by 552
A subdivision algorithm in configuration space for findpath with rotation
Brooks, R. A., & Lozano-Perez, T. (1985) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1985.6313352 · Cited by 550
Optimal Point Location in a Monotone Subdivision
Edelsbrunner, H., Guibas, L. J., & Stolfi, J. (1986) · SIAM Journal on Computing · doi:10.1137/0215023 · Cited by 502
A hierarchical data structure for picture processing
Tanimoto, S., & Pavlidis, T. (1975) · Computer Graphics and Image Processing · doi:10.1016/s0146-664x(75)80003-7 · Cited by 481
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
Knuth, D. E. (1978) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 369
The Design of Dynamic Data Structures
(1983) · Lecture Notes in Computer Science · doi:10.1007/bfb0014927 · Cited by 318
Segmentation and Estimation of Image Region Properties through Cooperative Hierarchial Computation
Burt, P. J., Hong, T.-H., & Rosenfeld, A. (1981) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1981.4308619 · Cited by 316
Experiments on picture representation using regular decomposition
Klinger, A., & Dyer, C. R. (1976) · Computer Graphics and Image Processing · doi:10.1016/s0146-664x(76)80006-8 · Cited by 278
Introduction to the Theory of Switching Circuits
Cattermole, K. W. (1966) · Electronics and Power · doi:10.1049/ep.1966.0295 · Cited by 260
Strip trees: a hierarchical representation for curves
Ballard, D. H. (1981) · Communications of the ACM · doi:10.1145/358645.358661 · Cited by 235
Introduction to the theory of switching circuits
McCluskey, E. J. (1965) · International Linear Collider · Cited by 231
Lee, D. T., & Wong, C. K. (1977) · Acta Informatica · doi:10.1007/bf00263763 · Cited by 220
Obstacle avoidance using an octree in the configuration space of a manipulator
Faverjon, B. (2005) · Proceedings. 1984 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1984.1087218 · Cited by 211
PATTERN RECOGNITION AND GEOMETRICAL COMPLEXITY.
Toussaint, G. T. (1980) · Unknown conference · Cited by 183
Layered "Recognition Cone" Networks That Preprocess, Classify, and Describe
Uhr, L. (1972) · IEEE Transactions on Computers · doi:10.1109/t-c.1972.223579 · Cited by 169
Tactile Recognition and Localization Using Object Models: The Case of Polyhedra on a Plane
Gaston, P. C., & Lozano‐Pérez, T. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767518 · Cited by 168
Representation of Three-Dimensional Digital Images
Srihari, S. N. (1981) · ACM Computing Surveys · doi:10.1145/356859.356862 · Cited by 157
Knowlton, K. (1980) · Proceedings of the IEEE · doi:10.1109/proc.1980.11754 · Cited by 155
Computer representation of planar regions by their skeletons
Pfaltz, J. L., & Rosenfeld, A. (1967) · Communications of the ACM · doi:10.1145/363067.363120 · Cited by 145
George Nagy, A., & Wagle, S. (1979) · ACM Computing Surveys · doi:10.1145/356770.356777 · Cited by 137
A hierarchical data structure for multidimensional digital images
Yau, M.-M., & Srihari, S. N. (1983) · Communications of the ACM · doi:10.1145/358150.358158 · Cited by 136
Applications of a planar separator theorem
Lipton, R. J., & Tarjan, R. E. (1977) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1977.6 · Cited by 130
Computational techniques in the visual segmentation of static scenes
Riseman, E. M., & Arbib, M. A. (1977) · Computer Graphics and Image Processing · doi:10.1016/s0146-664x(77)80028-2 · Cited by 124
Octree-Related Data Structures and Algorithms
Yamaguchi, K., Kunii, T. L., Fujimura, K., & Toriya, H. (1984) · IEEE Computer Graphics and Applications · doi:10.1109/mcg.1984.275901 · Cited by 111
Representation of contours and regions for efficient computer search
Merrill, R. D. (1973) · Communications of the ACM · doi:10.1145/361952.361956 · Cited by 97
Rosenfeld, A. (1972) · Computer Graphics and Image Processing · doi:10.1016/0146-664x(72)90024-x · Cited by 88
Cumulative generation of octree models from range data
Connolly, C. I. (2005) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1984.1087212 · Cited by 84
Analysis of range searches in quad trees
Bently, J. L., & Stanat, D. F. (1975) · Information Processing Letters · doi:10.1016/0020-0190(75)90034-4 · Cited by 73
Efficient octree conversion by connectivity labeling
Tamminen, M., & Samet, H. (1984) · ACM SIGGRAPH Conference (SIGGRAPH) · doi:10.1145/800031.808576 · Cited by 69
Self-citationRepresentation of three-dimensional objects
Reddy, D. R., & Rubin, S. M. (2018) · Figshare · doi:10.1184/r1/6609008 · Cited by 46
On approaches to polygonal decomposition for hierarchical image representation
Ahuja, N. (1983) · Computer Vision Graphics and Image Processing · doi:10.1016/0734-189x(83)90043-9 · Cited by 39
Rosenfeld, A. (1985) · Computer Vision Graphics and Image Processing · doi:10.1016/0734-189x(85)90096-9 · Cited by 12
A File Index for Document Storage and Retrieval Utilizing Descriptor Fragments
Allen, F. W. (1982) · The Computer Journal · doi:10.1093/comjnl/25.1.2 · Cited by 5
Cited by
Overview of the High Efficiency Video Coding (HEVC) Standard
Sullivan, G. J., Ohm, J.-R., Han, W.-J., & Wiegand, T. (2012) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2012.2221191 · Cited by 8,263
Local grayvalue invariants for image retrieval
Schmid, C., & Mohr, R. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.589215 · Cited by 1,432
Adaptive spatial binning of integral-field spectroscopic data using Voronoi tessellations
Cappellari, M., & Copin, Y. (2003) · Monthly Notices of the Royal Astronomical Society · doi:10.1046/j.1365-8711.2003.06541.x · Cited by 1,309
Query evaluation techniques for large databases
Graefe, G. (1993) · ACM Computing Surveys · doi:10.1145/152610.152611 · Cited by 1,262
Chávez, E., Navarro, G., Baeza-Yates, R., & Marroquín, J. L. (2001) · ACM Computing Surveys · doi:10.1145/502807.502808 · Cited by 1,246
Metadata
- Authors
- Samet, H.
- Venue
- ACM Computing Surveys
- Published
- 1984-06
- Volume
- 16
- Issue
- 2
- Pages
- 187-260
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2050576295
- Cited by
- 2,205
- References
- 67
- FWCI
- 48.27
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.