Approximate range searching in external memory
From MaRDI portal
(Redirected from Publication:627532)
Recommendations
Cites work
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Approximate closest-point queries in high dimensions
- Approximate range searching
- Approximate range searching using binary space partitions
- Balanced aspect ratio trees: Combining the advantages of k-d trees and octrees
- Box-trees and R-trees with near-optimal query time
- Box-trees for collision checking in industrial installations
- Efficient searching with linear constraints
- Guarding scenes against invasive hypercubes.
- scientific article; zbMATH DE number 1754589 (Why is no real title available?)
- scientific article; zbMATH DE number 1792106 (Why is no real title available?)
- R-trees: theory and applications
- Sharp quantum versus classical query complexity separations
- The design of dynamic data structures
- The priority R-tree: a practically efficient and worst-case optimal R-tree
Cited in
(8)- Approximate range searching
- Efficient external memory structures for range-aggregate queries
- Approximate range searching using binary space partitions
- Approximate Range Searching: The Absolute Model
- scientific article; zbMATH DE number 1256735 (Why is no real title available?)
- Maximizing Range Sum in External Memory
- Approximate Range Searching in External Memory
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
This page was built for publication: Approximate range searching in external memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q627532)
