Pages that link to "Item:Q1077166"
From MaRDI portal
The following pages link to Halfspace range search: An algorithmic application of k-sets (Q1077166):
Displayed 15 items.
- On bounded leg shortest paths problems (Q633848) (← links)
- On levels in arrangements and Voronoi diagrams (Q804321) (← links)
- Efficient algorithms for maximum regression depth (Q938312) (← links)
- Edge-skeletons in arrangements with applications (Q1091825) (← links)
- Line arrangements and range search (Q1107313) (← links)
- On \(k\)-sets in arrangements of curves and surfaces (Q1179129) (← links)
- An upper bound on the number of planar \(K\)-sets (Q1184155) (← links)
- Reporting points in halfspaces (Q1196295) (← links)
- Efficient partition trees (Q1199132) (← links)
- Cutting dense point sets in half (Q1355189) (← links)
- Efficient searching with linear constraints (Q1591152) (← links)
- New applications of random sampling in computational geometry (Q1820582) (← links)
- Applications of random sampling in computational geometry. II (Q1823685) (← links)
- Dynamic half-space range reporting and its applications (Q1891228) (← links)
- Robust shape fitting via peeling and grating coresets (Q5920504) (← links)