Algorithms for generalized halfspace range searching and other intersection searching problems
From MaRDI portal
Publication:5970603
DOI10.1016/0925-7721(95)00012-7zbMath0849.68025OpenAlexW1992428862MaRDI QIDQ5970603
Michiel H. M. Smid, Prosenjit Gupta, Ravi Janardan
Publication date: 4 November 1996
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0925-7721(95)00012-7
Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (5)
I/O-optimal categorical 3-sided skyline queries ⋮ Efficient range searching for categorical and plain data ⋮ Adaptive data structures for 2D dominance colored range counting ⋮ Unnamed Item ⋮ Dynamic connectivity for axis-parallel rectangles
Cites Work
- Unnamed Item
- Unnamed Item
- Range searching with efficient hierarchical cuttings
- On ray shooting in convex polytopes
- More on k-sets of finite sets in the plane
- The power of geometric duality
- Making data structures persistent
- Cutting hyperplane arrangements
- Efficient partition trees
- Connected component and simple polygon intersection searching
- Intersection Queries in Curved Objects
- Filtering Search: A New Approach to Query-Answering
- New Upper Bounds in Klee’s Measure Problem
- Algorithms for ray-shooting and intersection searching
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- GENERALIZED INTERSECTION SEARCHING PROBLEMS
- Space searching for intersecting objects
This page was built for publication: Algorithms for generalized halfspace range searching and other intersection searching problems