Pages that link to "Item:Q4388883"
From MaRDI portal
The following pages link to Computing Many Faces in Arrangements of Lines and Segments (Q4388883):
Displayed 7 items.
- From proximity to utility: a Voronoi partition of Pareto optima (Q331376) (← links)
- A note on visibility-constrained Voronoi diagrams (Q400517) (← links)
- A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space (Q407569) (← links)
- On separating points by lines (Q1985301) (← links)
- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location (Q2189742) (← links)
- Near-linear approximation algorithms for geometric hitting sets (Q2429345) (← links)
- Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions (Q5864671) (← links)