Computing generalized ham-sandwich cuts

DOI10.1016/J.IPL.2012.03.013zbMATH Open1243.68306OpenAlexW1985701396MaRDI QIDQ436593FDOQ436593

Sergey Bereg

Publication date: 25 July 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.03.013

Recommendations

• Generalized ham-sandwich cuts
• Dynamic ham-sandwich cuts in the plane
• Algorithms for ham-sandwich cuts
• Bisections and ham-sandwich cuts of convex polygons and polyhedra
• Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem

zbMATH Keywords

computational geometryham-sandwich theorem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Cites Work

• Title not available (Why is that?)
• Slicing convex sets and measures by a hyperplane
• Supporting spheres for families of independent convex sets
• Generalized ham-sandwich cuts

Cited In (5)

• Algorithms for ham-sandwich cuts
• Generalized ham-sandwich cuts
• A survey of mass partitions
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Computing generalized ham-sandwich cuts

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