Efficient partition trees
Author:
- 1 August 1992
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 8 (3) , 315-334
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Cutting hyperplane arrangementsDiscrete & Computational Geometry, 1991
- Partitioning arrangements of lines II: ApplicationsDiscrete & Computational Geometry, 1990
- Lower bounds on the complexity of polytope range searchingJournal of the American Mathematical Society, 1989
- ɛ-nets and simplex range queriesDiscrete & Computational Geometry, 1987
- Halfplanar range search in linear space and O(n0.695) query timeInformation Processing Letters, 1986
- Halfspace range search: An algorithmic application ofk-setsDiscrete & Computational Geometry, 1986
- The power of geometric dualityBIT Numerical Mathematics, 1985
- Polygon RetrievalSIAM Journal on Computing, 1982
- Decomposable searching problemsInformation Processing Letters, 1979
- On the Uniform Convergence of Relative Frequencies of Events to Their ProbabilitiesTheory of Probability & Its Applications, 1971