Efficient partition trees

This publication has 23 references indexed in Scilit:

• Applications of a new space partitioning technique
  Published by Springer Nature ,2005
• Cutting hyperplane arrangements
  Discrete & Computational Geometry, 1991
• Lower bounds on the complexity of polytope range searching
  Journal of the American Mathematical Society, 1989
• ɛ-nets and simplex range queries
  Discrete & Computational Geometry, 1987
• Halfplanar range search in linear space and O(n0.695) query time
  Information Processing Letters, 1986
• Halfspace range search: An algorithmic application ofk-sets
  Discrete & Computational Geometry, 1986
• The power of geometric duality
  BIT Numerical Mathematics, 1985
• Polygon Retrieval
  SIAM Journal on Computing, 1982
• Decomposable searching problems
  Information Processing Letters, 1979
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
  Theory of Probability and Its Applications, 1971