Partitioning Space for Range Queries
- 1 April 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 18 (2) , 371-384
- https://doi.org/10.1137/0218025
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Space searching for intersecting objectsJournal of Algorithms, 1987
- ɛ-nets and simplex range queriesDiscrete & Computational Geometry, 1987
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987
- Partitioning point sets in arbitrary dimensionTheoretical Computer Science, 1987
- Halfplanar range search in linear space and O(n0.695) query timeInformation Processing Letters, 1986
- Partitioning with two lines in the planeJournal of Algorithms, 1985
- Non-partitionable point setsInformation Processing Letters, 1984
- Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal AlgorithmSIAM Journal on Computing, 1984
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975
- Simultane Vierteilung zweier KörperArchiv der Mathematik, 1966