Pages that link to "Item:Q685178"
From MaRDI portal
The following pages link to How hard is half-space range searching? (Q685178):
Displaying 22 items.
- Tight lower bounds for halfspace range searching (Q420572) (← links)
- \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets (Q527442) (← links)
- Range searching with efficient hierarchical cuttings (Q685179) (← links)
- The effect of corners on the complexity of approximate range searching (Q1014333) (← links)
- Halfspace range search: An algorithmic application of k-sets (Q1077166) (← links)
- Halfplanar range search in linear space and \(O(n^{0.695})\) query time (Q1097038) (← links)
- Reporting points in halfspaces (Q1196295) (← links)
- The power of nonmonotonicity in geometric searching (Q1424314) (← links)
- Approximate range searching (Q1595401) (← links)
- On the combinatorial complexity of approximating polytopes (Q1688856) (← links)
- New lower bounds for Hopcroft's problem (Q1816464) (← links)
- Lower bounds for intersection searching and fractional cascading in higher dimension (Q1887711) (← links)
- Efficient independent set approximation in unit disk graphs (Q2181244) (← links)
- Approximate range searching: The absolute model (Q2269144) (← links)
- Approximate range searching in higher dimension (Q2456663) (← links)
- Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
- On the difficulty of range searching (Q5057458) (← links)
- Polynomial Data Structure Lower Bounds in the Group Model (Q5067444) (← links)
- Economical Delone Sets for Approximating Convex Bodies (Q5116467) (← links)
- Lower bounds for intersection searching and fractional cascading in higher dimension (Q5175986) (← links)
- On semialgebraic range reporting (Q6145667) (← links)
- Economical convex coverings and applications (Q6583674) (← links)
