Box-trees and R-trees with near-optimal query time
From MaRDI portal
Publication:1849440
DOI10.1007/S00454-002-2817-1zbMATH Open1016.68058OpenAlexW2134438395MaRDI QIDQ1849440FDOQ1849440
Authors: Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman Haverkort 
Publication date: 1 December 2002
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-002-2817-1
Recommendations
- Box-trees and R-trees with near-optimal query time
- On R-trees with low query complexity
- Reflections on Optimal and Nearly Optimal Binary Search Trees
- Efficient Construction of Near-Optimal Binary and Multiway Search Trees
- Efficient bulk operations on dynamic \(R\)-trees
- On Cartesian trees and range minimum queries
- On Cartesian Trees and Range Minimum Queries
- Succinct representations of binary trees for range minimum queries
- Cache-oblivious R-trees
Cited In (10)
- Approximate Range Searching in External Memory
- Box-trees and R-trees with near-optimal query time
- Efficient \(c\)-oriented range searching with DOP-trees
- Box-trees for collision checking in industrial installations
- The priority R-tree: a practically efficient and worst-case optimal R-tree
- Cache-oblivious R-trees
- On R-trees with low query complexity
- Approximate range searching in external memory
- Approximate range searching using binary space partitions
- Title not available (Why is that?)
This page was built for publication: Box-trees and R-trees with near-optimal query time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1849440)
