FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

DOI10.1007/B104325zbMATH Open1117.68350OpenAlexW2950473912MaRDI QIDQ5465845FDOQ5465845

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

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

Mathematics Subject Classification ID

Data structures (68P05)

Cited In (5)

• Title not available (Why is that?)
• Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
• Quasi-optimal range searching in spaces of finite VC-dimension
• Approximate range searching using binary space partitions
• Approximate Range Searching: The Absolute Model

This page was built for publication: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

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