Data Structures for Range Searching
- 1 December 1979
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 11 (4) , 397-409
- https://doi.org/10.1145/356789.356797
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Multidimensional Binary Search Trees in Database ApplicationsIEEE Transactions on Software Engineering, 1979
- Decomposable searching problemsInformation Processing Letters, 1979
- The complexity of finding fixed-radius near neighborsInformation Processing Letters, 1977
- An Algorithm for Finding Best Matches in Logarithmic Expected TimeACM Transactions on Mathematical Software, 1977
- Application of Principal Component Analysis to Multikey SearchingIEEE Transactions on Software Engineering, 1976
- Multidimensional Searching ProblemsSIAM Journal on Computing, 1976
- Heuristics for partial-match retrieval data base designInformation Processing Letters, 1976
- An Algorithm for Finding Nearest NeighborsIEEE Transactions on Computers, 1975
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975
- Quad trees a data structure for retrieval on composite keysActa Informatica, 1974