Approximate Range Searching in External Memory
From MaRDI portal
Publication:5387785
DOI10.1007/978-3-540-77120-3_47zbMATH Open1193.68093OpenAlexW1506338203MaRDI QIDQ5387785FDOQ5387785
Authors: Micha Streppel, Ke Yi 
Publication date: 27 May 2008
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://research.tue.nl/nl/publications/2d194424-f6b4-46e4-9853-b7fd9e2c21ef
Recommendations
Cites Work
- The design of dynamic data structures
- Efficient searching with linear constraints
- Title not available (Why is that?)
- Realistic input models for geometric algorithms
- Approximate range searching using binary space partitions
- Balanced aspect ratio trees: Combining the advantages of \(k\)-\(d\) trees and octrees
- Guarding scenes against invasive hypercubes.
- The priority R-tree
- Approximate range searching
- R-trees: theory and applications
- Box-trees and R-trees with near-optimal query time
- Title not available (Why is that?)
- Box-trees for collision checking in industrial installations
- Title not available (Why is that?)
Cited In (9)
- Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions
- Maximizing Range Sum in External Memory
- Computing and Combinatorics
- Efficient external memory structures for range-aggregate queries
- Approximate range searching in external memory
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Approximate range searching
- Title not available (Why is that?)
- Approximate Range Searching: The Absolute Model
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 Q5387785)
