Covering Folded Shapes
Computational Geometry
2014-05-13 v1
Abstract
Can folding a piece of paper flat make it larger? We explore whether a shape must be scaled to cover a flat-folded copy of itself. We consider both single folds and arbitrary folds (continuous piecewise isometries ). 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.
Keywords
Cite
@article{arxiv.1405.2378,
title = {Covering Folded Shapes},
author = {Oswin Aichholzer and Greg Aloupis and Erik D. Demaine and Martin L. Demaine and Sándor P. Fekete and Michael Hoffmann and Anna Lubiw and Jack Snoeyink and Andrew Winslow},
journal= {arXiv preprint arXiv:1405.2378},
year = {2014}
}
Comments
19 pages, 10 figures, to appear in Journal of Computational Geometry (JoCG)