Optimal external memory planar point enclosure
From MaRDI portal
(Redirected from Publication:834582)
Recommendations
Cites work
- scientific article; zbMATH DE number 1670656 (Why is no real title available?)
- scientific article; zbMATH DE number 3653523 (Why is no real title available?)
- scientific article; zbMATH DE number 1241835 (Why is no real title available?)
- scientific article; zbMATH DE number 910894 (Why is no real title available?)
- A new approach to rectangle intersections part I
- Box-trees and R-trees with near-optimal query time
- Filtering Search: A New Approach to Query-Answering
- Fractional cascading. I: A data structuring technique
- How to find a battleship
- I/O-efficient point location using persistent B-trees
- Lower bounds for orthogonal range searching: I. The reporting case
- Making data structures persistent
- Multidimensional divide-and-conquer
- On a model of indexability and its bounds for range queries
- Optimal External Memory Interval Management
- The priority R-tree: a practically efficient and worst-case optimal R-tree
Cited in
(4)
This page was built for publication: Optimal external memory planar point enclosure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834582)