Approximate Range Searching in External Memory

DOI10.1007/978-3-540-77120-3_47zbMath1193.68093OpenAlexW1506338203MaRDI QIDQ5387785

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

Mathematics Subject Classification ID

Data structures (68P05)

Related Items

Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The design of dynamic data structures
• Guarding scenes against invasive hypercubes.
• Efficient searching with linear constraints
• Approximate range searching
• R-trees: theory and applications
• Box-trees and R-trees with near-optimal query time
• 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
• Box-trees for collision checking in industrial installations
• The priority R-tree