Packing a Cake into a Box

  title={Packing a Cake into a Box},
  author={Mikhail Skopenkov},
  journal={The American Mathematical Monthly},
  pages={424 - 433}
  • M. Skopenkov
  • Published 10 March 2010
  • Physics
  • The American Mathematical Monthly
Abstract Given a triangular cake and a box in the shape of its mirror image, how can the cake be cut into a minimal number of pieces so that it can be put into the box? The cake has icing, so we are not allowed to put it into the box upside down. V. G. Boltyansky asked this question in 1977 and showed that three pieces always suffice. In this paper we provide examples of cakes that cannot be cut into two pieces to be put into the box. This shows that three is the answer to Boltyansky's question… 
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing
It is proved that finding a smallest convex polygon that encloses any of the given polygons is NP-hard, and a PTAS for minimizing the perimeter of the convex enclosure is given.


Dissection of a Triangle into Similar Triangles
AbstractWe prove that the number of non-similar triangles T which can be dissected into two, three or five similar non-right triangles is equal to zero, one and nine, respectively. We find all these
How Does One Cut a Triangle
The Original Book.- A Pool Table, Irrational Numbers, and Integral Independence.- How Does One Cut a Triangle? I.- Excursions in Algebra.- How Does One Cut a Triangle? II.- Excursion in
Boltianskii, Hilbert’s Third Problem
  • 1978
Invariants of polygons
  • XIX Summer conference of the International mathematical tournament of towns
  • 2007
Boltyanski's cake problem-From the Wolfram Demonstrations Project
  • 2010
Boltyanski’s cake problem—From the Wolfram Demonstrations Project (2010), http: //
  • 2010
Covering a triangle with triangles
  • Amer. Math. Monthly
  • 2005