Computing generalized ham-sandwich cuts

DOI10.1016/J.IPL.2012.03.013MaRDI QIDQ436593zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

computational geometryham-sandwich theorem

Mathematics Subject Classification ID

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

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

Cites work

• Generalized ham-sandwich cuts
• scientific article; zbMATH DE number 1528185 (Why is no real title available?)
• Slicing convex sets and measures by a hyperplane
• Supporting spheres for families of independent convex sets

Cited in

(11)

• Dynamic ham-sandwich cuts in the plane
• Bisections and ham-sandwich cuts of convex polygons and polyhedra
• Algorithms for ham-sandwich cuts
• Computing balanced convex partitions of lines
• scientific article; zbMATH DE number 5999585 (Why is no real title available?)
• A survey of mass partitions
• Orthogonal ham-sandwich theorem in \(\mathbb{R}^3\)
• scientific article; zbMATH DE number 7662165 (Why is no real title available?)
• Generalized ham-sandwich cuts
• Computing balanced convex partitions of lines
• Computational complexity of the -Ham-Sandwich problem

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)