Approximations and optimal geometric divide-and-conquer

DOI10.1006/jcss.1995.1018zbMath0827.68048OpenAlexW4210817330MaRDI QIDQ1892216

Jiří Mastoušek

Publication date: 13 December 1995

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1995.1018

zbMATH Keywords

computational geometrydivide-and-conquer

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Related Items (16)

Separability of imprecise points ⋮ Covering many or few points with unit disks ⋮ The \(\varepsilon\)-\(t\)-net problem ⋮ A deterministic algorithm for the three-dimensional diameter problem ⋮ Subquadratic algorithms for algebraic 3SUM ⋮ Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\) ⋮ Ham-sandwich cuts for abstract order types ⋮ Lines avoiding balls in three dimensions revisited ⋮ Linear approximation of simple objects ⋮ A note on searching line arrangements and applications ⋮ Core-Sets: Updated Survey ⋮ Near-linear time approximation schemes for geometric maximum coverage ⋮ A linear-time algorithm for the geodesic center of a simple polygon ⋮ Packing and covering balls in graphs excluding a minor ⋮ Fast stabbing of boxes in high dimensions ⋮ Unnamed Item

This page was built for publication: Approximations and optimal geometric divide-and-conquer