Geodesic ham-sandwich cuts

DOI10.1007/S00454-006-1287-2MaRDI QIDQ878384zbMATH OpenOpenAlexFDO

Authors Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin

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

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10) General convexity (52A99) Algorithms in computer science (68W99) Linear programming (90C05)

Recommendations

• Geodesic ham-sandwich cuts
• Computing a ham-sandwich cut in two dimensions
• Algorithms for ham-sandwich cuts
• Dynamic ham-sandwich cuts in the plane
• Generalizing ham sandwich cuts to equitable subdivisions

Cited in

(11)

• Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem
• Discrete geometry on colored point sets in the plane -- a survey
• Dividing a territory among several vehicles
• Computing a visibility polygon using few variables
• Relative convex hulls in semi-dynamic arrangements
• A survey of mass partitions
• Convex hulls in polygonal domains
• Geodesic ham-sandwich cuts
• A generalized Winternitz theorem
• Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon
• Uneven splitting of ham sandwiches

This page was built for publication: Geodesic ham-sandwich cuts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878384)