On partitioning a cake

DOI10.1007/B11261zbMATH Open1179.52002OpenAlexW62175113MaRDI QIDQ5897089FDOQ5897089

Sergei Bespamyatnikh

Publication date: 5 February 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11261

Recommendations

• Publication:4504015
• On the structure of Pareto optimal cake partitions
• On the possibilities for partitioning a cake
• On the geometry of cake division
• A note on the cake-division problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Convex sets in (2) dimensions (including convex curves) (52A10)

Cited In (11)

• Title not available (Why is that?)
• Equal-area locus-based convex polygon decomposition
• On the complexity of cake cutting
• Ramsey partitions of integers and fair divisions
• Twenty years of progress of \(\mathrm{JCDCG}^3\)
• Equal-Area Locus-Based Convex Polygon Decomposition
• Title not available (Why is that?)
• Algorithms for fair partitioning of convex polygons
• A survey of mass partitions
• On the possibilities for partitioning a cake
• How to divide a cake when people have different metabolism?

This page was built for publication: On partitioning a cake

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