Orthogonal queries in segments
From MaRDI portal
Publication:1355726
DOI10.1007/BF02526035zbMath0868.68110OpenAlexW2050447226MaRDI QIDQ1355726
Publication date: 17 August 1997
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02526035
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Range searching with efficient hierarchical cuttings
- The design of dynamic data structures
- Some dynamic computational geometry problems
- A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency
- Making data structures persistent
- Efficient partition trees
- Quasi-optimal upper bounds for simplex range searching and new zone theorems
- Reporting and counting segment intersections
- Lower Bounds on the Complexity of Polytope Range Searching
- Lower bounds for orthogonal range searching: I. The reporting case
- New Data Structures for Orthogonal Range Queries
- Filtering Search: A New Approach to Query-Answering
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Algorithms for ray-shooting and intersection searching
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Space searching for intersecting objects
This page was built for publication: Orthogonal queries in segments
