Spatial indexing in binary decomposition and spatial bounding
- 31 December 1991
- journal article
- Published by Elsevier in Information Systems
- Vol. 16 (2) , 211-237
- https://doi.org/10.1016/0306-4379(91)90016-3
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Hierarchical representations of collections of small rectanglesACM Computing Surveys, 1988
- A B+-tree structure for large quadtreesComputer Vision, Graphics, and Image Processing, 1984
- A file organization for geographic information systems based on spatial proximityComputer Vision, Graphics, and Image Processing, 1984
- The Quadtree and Related Hierarchical Data StructuresACM Computing Surveys, 1984
- The Grid FileACM Transactions on Database Systems, 1984
- Binary trees pagingInformation Systems, 1982
- Data Structures for Range SearchingACM Computing Surveys, 1979
- Extendible hashing—a fast access method for dynamic filesACM Transactions on Database Systems, 1979
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975
- Organization and maintenance of large ordered indexesActa Informatica, 1972