Approximate range searching using binary space partitions

DOI10.1007/978-3-540-30538-5_10MaRDI QIDQ5465845zbMATH OpenOpenAlexFDO

Authors Micha Streppel, Mark de Berg

Publication date 12 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b104325

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Approximate range searching using binary space partitions
• Approximate range searching in higher dimension
• Approximate range searching
• Tight lower bounds for halfspace range searching
• Tight lower bounds for halfspace range searching
• A dynamic data structure for approximate range searching
• EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS*
• Quasi-optimal range searching in spaces of finite VC-dimension
• Approximate Range Searching in External Memory
• Approximate range searching in external memory

Cited in

(5)

• Quasi-optimal range searching in spaces of finite VC-dimension
• Approximate range searching using binary space partitions
• Approximate Range Searching: The Absolute Model
• Variable sized partitions for range query algorithms
• Ray shooting and intersection searching amidst fat convex polyhedra in 3-space

This page was built for publication: Approximate range searching using binary space partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5465845)