Approximations and optimal geometric divide-and-conquer
From MaRDI portal
(Redirected from Publication:1892216)
Recommendations
Cited in
(27)- Cutting hyperplanes for divide-and-conquer
- Bounded-independance derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming
- Fast stabbing of boxes in high dimensions
- Near-linear time approximation schemes for geometric maximum coverage
- A deterministic algorithm for the three-dimensional diameter problem
- Packing and covering balls in graphs excluding a minor
- The \(\varepsilon\)-\(t\)-net problem
- Separability of imprecise points
- Subquadratic algorithms for algebraic 3SUM
- A note on searching line arrangements and applications
- Core-sets: updated survey
- Algorithms for ε-Approximations of Terrains
- Product Range Spaces, Sensitive Sampling, and Derandomization
- Lines avoiding balls in three dimensions revisited
- scientific article; zbMATH DE number 5019895 (Why is no real title available?)
- scientific article; zbMATH DE number 7053310 (Why is no real title available?)
- Data reduction for weighted and outlier-resistant clustering
- Linear approximation of simple objects
- Relative (p, )-approximations in geometry
- The geodesic edge center of a simple polygon
- Hopcroft's problem, log* shaving, two-dimensional fractional cascading, and decision trees
- A linear-time algorithm for the geodesic center of a simple polygon
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings
- A linear time algorithm for the maximum overlap of two convex polygons under translation
- Covering many or few points with unit disks
- Space-efficient geometric divide-and-conquer algorithms
- Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\)
This page was built for publication: Approximations and optimal geometric divide-and-conquer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892216)
