Geodesic ham-sandwich cuts
From MaRDI portal
Publication:878384
DOI10.1007/s00454-006-1287-2zbMath1136.90390OpenAlexW2150122711MaRDI QIDQ878384
Pat Morin, Erik D. Demaine, Prosenjit Bose, Ferran Hurtado, John Iacono, Stefan Langerman
Publication date: 26 April 2007
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-006-1287-2
Linear programming (90C05) Convex sets in (2) dimensions (including convex curves) (52A10) Algorithms in computer science (68W99) General convexity (52A99)
Related Items
Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem ⋮ A survey of mass partitions ⋮ Discrete geometry on colored point sets in the plane -- a survey ⋮ Computing a visibility polygon using few variables ⋮ A generalized Winternitz theorem ⋮ Relative convex hulls in semi-dynamic arrangements ⋮ Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon ⋮ Unnamed Item ⋮ Dividing a Territory Among Several Vehicles
This page was built for publication: Geodesic ham-sandwich cuts
