Pages that link to "Item:Q1892216"
From MaRDI portal
The following pages link to Approximations and optimal geometric divide-and-conquer (Q1892216):
Displaying 23 items.
- Lines avoiding balls in three dimensions revisited (Q443898) (← links)
- Relative \((p,\varepsilon )\)-approximations in geometry (Q633202) (← links)
- A linear-time algorithm for the geodesic center of a simple polygon (Q728492) (← links)
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings (Q728495) (← links)
- Covering many or few points with unit disks (Q839638) (← links)
- Space-efficient geometric divide-and-conquer algorithms (Q883238) (← links)
- Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\) (Q906384) (← links)
- Cutting hyperplanes for divide-and-conquer (Q1209837) (← links)
- Bounded-independance derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming (Q1380803) (← links)
- Fast stabbing of boxes in high dimensions (Q1583093) (← links)
- Ham-sandwich cuts for abstract order types (Q1702128) (← links)
- Near-linear time approximation schemes for geometric maximum coverage (Q1748995) (← links)
- A deterministic algorithm for the three-dimensional diameter problem (Q1917056) (← links)
- Packing and covering balls in graphs excluding a minor (Q2043760) (← links)
- The \(\varepsilon\)-\(t\)-net problem (Q2167320) (← links)
- Separability of imprecise points (Q2362104) (← links)
- Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
- A note on searching line arrangements and applications (Q2444761) (← links)
- Core-Sets: Updated Survey (Q3297370) (← links)
- (Q5290249) (← links)
- (Q5743431) (← links)
- (Q5743481) (← links)
- Linear approximation of simple objects (Q5890660) (← links)
