Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines
From MaRDI portal
Publication:1041794
DOI10.1016/j.ipl.2005.04.008zbMath1185.68835OpenAlexW4246456134MaRDI QIDQ1041794
Publication date: 4 December 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1903/1325
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Efficient range searching for categorical and plain data ⋮ A new framework for addressing temporal range queries and some preliminary results
Cites Work
- Making data structures persistent
- Intersection Queries in Curved Objects
- Lower bounds for orthogonal range searching: I. The reporting case
- Filtering Search: A New Approach to Query-Answering
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- Lower bounds for intersection searching and fractional cascading in higher dimension
- GENERALIZED INTERSECTION SEARCHING PROBLEMS
- Unnamed Item
- Unnamed Item
- Unnamed Item