Pages that link to "Item:Q1201746"
From MaRDI portal
The following pages link to Quasi-optimal upper bounds for simplex range searching and new zone theorems (Q1201746):
Displayed 21 items.
- 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)
- Applications of a new space-partitioning technique (Q1196362) (← links)
- Efficient partition trees (Q1199132) (← links)
- Iterated nearest neighbors and finding minimal polytopes (Q1327455) (← links)
- On range searching with semialgebraic sets (Q1329188) (← links)
- Efficient ray shooting and hidden surface removal (Q1330784) (← links)
- Orthogonal queries in segments (Q1355726) (← links)
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects (Q1370928) (← links)
- Ray shooting and stone throwing with near-linear storage (Q1776898) (← links)
- New lower bounds for Hopcroft's problem (Q1816464) (← links)
- Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment (Q1886235) (← links)
- Dynamic half-space range reporting and its applications (Q1891228) (← links)
- Computing depth orders for fat objects and related problems (Q1917032) (← links)
- Simplex range reporting on a pointer machine (Q1917035) (← links)
- Point location in zones of \(k\)-flats in arrangements (Q1917049) (← links)
- Connected component and simple polygon intersection searching (Q1918994) (← links)
- Ray shooting on triangles in 3-space (Q2366231) (← links)
- ON ENUMERATING AND SELECTING DISTANCES (Q4682169) (← links)