Covering folded shapes

Authors

  • Oswin Aichholzer TU Graz
  • Greg Aloupis Tufts University
  • Erik D. Demaine MIT
  • Martin L. Demaine MIT
  • Sándor P. Fekete TU Braunschweig
  • Michael Hoffmann ETH Zurich
  • Anna Lubiw University of Waterloo
  • Jack Snoeyink University of North Carolina
  • Andrew Winslow Tufts University

DOI:

https://doi.org/10.20382/jocg.v5i1a8

Abstract

Can folding a piece of paper flat make it larger? We explore whether a shape S must be scaled to cover a flat-folded copy of itself. We consider both single folds and arbitrary folds (continuous piecewise isometries \(S\to\mathbb{R}^2\)). The underlying problem is motivated by computational origami, and is related to other covering and fixturing problems, such as Lebesgue's universal cover problem and force closure grasps. In addition to considering special shapes (squares, equilateral triangles, polygons and disks), we give upper and lower bounds on scale factors for single folds of convex objects and arbitrary folds of simply connected objects.

Downloads

Download data is not yet available.

Author Biographies

Oswin Aichholzer, TU Graz

Institute for Software Technology

Greg Aloupis, Tufts University

Department of Computer Science

Erik D. Demaine, MIT

Computer Science and Artificial Intelligence Laboratory

Martin L. Demaine, MIT

Computer Science and Artificial Intelligence Laboratory

Sándor P. Fekete, TU Braunschweig

Department of Computer Science

Michael Hoffmann, ETH Zurich

Institute of Theoretical Computer Science

Anna Lubiw, University of Waterloo

David R. Cheriton School of Computer Science

Jack Snoeyink, University of North Carolina

Department of Computer Science

Andrew Winslow, Tufts University

Department of Computer Science

Downloads

Published

2014-05-12

Issue

Section

Articles