Recommendations
Cites work
- scientific article; zbMATH DE number 3887059 (Why is no real title available?)
- scientific article; zbMATH DE number 1280933 (Why is no real title available?)
- scientific article; zbMATH DE number 1875404 (Why is no real title available?)
- Analysis of a bounding box heuristic for object intersection
- Enclosing many boxes by an optimal pair of boxes
Cited in
(18)- Algorithms and Data Structures
- scientific article; zbMATH DE number 1945905 (Why is no real title available?)
- scientific article; zbMATH DE number 1961032 (Why is no real title available?)
- Cache-oblivious R-trees
- Box-trees and R-trees with near-optimal query time
- Efficient \(c\)-oriented range searching with DOP-trees
- Efficient bulk operations on dynamic \(R\)-trees
- scientific article; zbMATH DE number 176587 (Why is no real title available?)
- Cache-oblivious R-trees
- The priority R-tree: a practically efficient and worst-case optimal R-tree
- Hyperorthogonal well-folded Hilbert curves
- Algorithms for improving the quality of \(R\)-trees
- Hyperorthogonal well-folded Hilbert curves
- A GIS data index method based on R-trees
- On Cartesian Trees and Range Minimum Queries
- R-trees: theory and applications
- Box-trees and R-trees with near-optimal query time
- scientific article; zbMATH DE number 1670656 (Why is no real title available?)
This page was built for publication: On R-trees with low query complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869749)
