The following pages link to Construction of \(\epsilon\)-nets (Q914376):
Displaying 27 items.
- Relative \((p,\varepsilon )\)-approximations in geometry (Q633202) (← links)
- A non-linear lower bound for planar epsilon-nets (Q664354) (← links)
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings (Q728495) (← links)
- On Desarguesian extensions of elation nets (Q798955) (← links)
- Partitioning arrangements of lines. I: An efficient deterministic algorithm (Q914373) (← links)
- Partitioning arrangements of lines. II: Applications (Q921915) (← links)
- \(\epsilon\)-nets and simplex range queries (Q1089803) (← links)
- Cutting hyperplane arrangements (Q1176317) (← links)
- On disjoint concave chains in arrangements of (pseudo) lines (Q1183468) (← links)
- The number of edges of many faces in a line segment arrangement (Q1200271) (← links)
- Cutting hyperplanes for divide-and-conquer (Q1209837) (← links)
- Corrigendum to: ``On disjoint concave chains in arrangements of (pseudo) lines'' (Q1328765) (← links)
- Algorithms for ham-sandwich cuts (Q1329191) (← links)
- On lines missing polyhedral sets in 3-space (Q1334933) (← links)
- The common exterior of convex polygons in the plane (Q1367170) (← links)
- Ham-sandwich cuts for abstract order types (Q1702128) (← links)
- Almost optimal set covers in finite VC-dimension (Q1906049) (← links)
- Lines in space: Combinatorics and algorithms (Q1913699) (← links)
- A center transversal theorem for hyperplanes and applications to graph drawing (Q1942307) (← links)
- Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
- Approximating the k-Level in Three-Dimensional Plane Arrangements (Q4604386) (← links)
- (Q4889406) (← links)
- (Q4934365) (← links)
- A survey of mass partitions (Q5067418) (← links)
- Extending the centerpoint theorem to multiple points (Q5091045) (← links)
- Space–Query-Time Tradeoff for Computing the Visibility Polygon (Q5321702) (← links)
- Epsilon nets and union complexity (Q5370694) (← links)
