Pages that link to "Item:Q3471697"
From MaRDI portal
The following pages link to Lower Bounds on the Complexity of Polytope Range Searching (Q3471697):
Displaying 32 items.
- Tight lower bounds for halfspace range searching (Q420572) (← links)
- Optimal partition trees (Q420575) (← links)
- On counting pairs of intersecting segments and off-line triangle range searching (Q676268) (← links)
- How hard is half-space range searching? (Q685178) (← links)
- Range searching with efficient hierarchical cuttings (Q685179) (← links)
- On ray shooting in convex polytopes (Q685183) (← links)
- The power of parallel projection (Q685515) (← links)
- Partitioning arrangements of lines. II: Applications (Q921915) (← links)
- Enclosing weighted points with an almost-unit ball (Q990963) (← links)
- The effect of corners on the complexity of approximate range searching (Q1014333) (← links)
- Point sets in the unit square and large areas of convex hulls of subsets of points (Q1016043) (← links)
- Generalizations of Heilbronn's triangle problem (Q1039441) (← links)
- On \(k\)-sets in arrangements of curves and surfaces (Q1179129) (← links)
- Reporting points in halfspaces (Q1196295) (← links)
- Efficient partition trees (Q1199132) (← links)
- Quasi-optimal upper bounds for simplex range searching and new zone theorems (Q1201746) (← links)
- On range searching with semialgebraic sets (Q1329188) (← links)
- Can visibility graphs be represented compactly? (Q1338961) (← links)
- Orthogonal queries in segments (Q1355726) (← links)
- Approximate range searching (Q1595401) (← links)
- New lower bounds for Hopcroft's problem (Q1816464) (← links)
- Lower bounds for intersection searching and fractional cascading in higher dimension (Q1887711) (← links)
- Dynamic half-space range reporting and its applications (Q1891228) (← links)
- Lower bounds for set intersection queries (Q1899448) (← links)
- Simplex range reporting on a pointer machine (Q1917035) (← links)
- Approximate range searching: The absolute model (Q2269144) (← links)
- Lower bounds for off-line range searching (Q2365324) (← links)
- Distributions of points in the unit square and large \(k\)-gons (Q2427543) (← links)
- Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures (Q3000523) (← links)
- Spanning trees with low crossing number (Q3358265) (← links)
- Heilbronn triangle‐type problems in the unit square [0,1]<sup>2</sup> (Q6074876) (← links)
- On semialgebraic range reporting (Q6145667) (← links)
