Pages that link to "Item:Q1079816"
From MaRDI portal
The following pages link to More on k-sets of finite sets in the plane (Q1079816):
Displaying 14 items.
- On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\) (Q443913) (← links)
- Relative \((p,\varepsilon )\)-approximations in geometry (Q633202) (← links)
- On levels in arrangements and Voronoi diagrams (Q804321) (← links)
- Partitioning arrangements of lines. I: An efficient deterministic algorithm (Q914373) (← links)
- Construction of \(\epsilon\)-nets (Q914376) (← links)
- Line arrangements and range search (Q1107313) (← links)
- The complexity of point configurations (Q1175788) (← links)
- An upper bound on the number of planar \(K\)-sets (Q1184155) (← links)
- On the expected number of \(k\)-sets (Q1327450) (← links)
- Applications of random sampling in computational geometry. II (Q1823685) (← links)
- Algorithms for generalized halfspace range searching and other intersection searching problems (Q1917041) (← links)
- On some monotone path problems in line arrangements (Q2387201) (← links)
- PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS (Q4818570) (← links)
- Algorithms for generalized halfspace range searching and other intersection searching problems (Q5970603) (← links)
