Pages that link to "Item:Q1917041"
From MaRDI portal
The following pages link to Algorithms for generalized halfspace range searching and other intersection searching problems (Q1917041):
Displaying 12 items.
- A technique for adding range restrictions to generalized searching problems (Q293144) (← links)
- Tight lower bounds for halfspace range searching (Q420572) (← links)
- Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines (Q1041794) (← links)
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects (Q1370928) (← links)
- Segment intersection searching problems in general settings (Q1404529) (← links)
- Data structures for range-aggregation over categories (Q2909107) (← links)
- Semialgebraic Range Reporting and Emptiness Searching with Applications (Q3096093) (← links)
- EFFICIENT NON-INTERSECTION QUERIES ON AGGREGATED GEOMETRIC DATA (Q3405967) (← links)
- Algorithms for ray-shooting and intersection searching (Q4015270) (← links)
- Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
- Further results on generalized intersection searching problems: Counting, reporting, and dynamization (Q5060128) (← links)
- GENERALIZED INTERSECTION SEARCHING PROBLEMS (Q5289294) (← links)