Scandinavian thins on top of cake: On the smallest one-size-fits-all box

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

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 for the 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.

Original languageEnglish (US)
Title of host publicationFun with Algorithms - 6th International Conference, FUN 2012, Proceedings
Pages16-27
Number of pages12
DOIs
StatePublished - Jun 13 2012
Event6th International Conference on Fun with Algorithms, FUN 2012 - Venice, Italy
Duration: Jun 4 2012Jun 6 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7288 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other6th International Conference on Fun with Algorithms, FUN 2012
CountryItaly
CityVenice
Period6/4/126/6/12

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Scandinavian thins on top of cake: On the smallest one-size-fits-all box'. Together they form a unique fingerprint.

  • Cite this

    Arkin, E. M., Efrat, A., Hart, G., Kostitsyna, I., Kröller, A., Mitchell, J. S. B., & Polishchuk, V. (2012). Scandinavian thins on top of cake: On the smallest one-size-fits-all box. In Fun with Algorithms - 6th International Conference, FUN 2012, Proceedings (pp. 16-27). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7288 LNCS). https://doi.org/10.1007/978-3-642-30347-0_5