Scandinavian thins on top of cake: New and improved algorithms for stacking and packing

Helmut Alt, Esther M. Arkin, Alon Efrat, George Hart, Ferran Hurtado, Irina Kostitsyna, Alexander Kröller, Joseph S.B. Mitchell, Valentin Polishchuk

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


We show how to compute the smallest rectangle that can enclose any polygon, from a given set of polygons, in nearly linear time; we also present a PTAS forthe problem, as well as a linear-time algorithm for the case when the polygons are rectangles themselves.We prove that finding a smallest convex polygon that encloses any of the given polygons is NP-hard, and give a PTAS for minimizing the perimeter of the convex enclosure. We also give efficient algorithms to find the smallest rectangle simultaneously enclosing a given pair of convex polygons.

Original languageEnglish (US)
Pages (from-to)689-714
Number of pages26
JournalTheory of Computing Systems
Issue number4
StatePublished - May 2014


  • Computational geometry
  • Enclosure
  • Packing

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics


Dive into the research topics of 'Scandinavian thins on top of cake: New and improved algorithms for stacking and packing'. Together they form a unique fingerprint.

Cite this