Graph explorer

Covering Folded Shapes

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\rightarrow 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.

11 nodes10 linksoverview previewCovering Folded Shapes
11 nodes10 links
Covering Folded Shapes11 visible / 11 total nodes / 46 links
Co-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipAuthorshipAuthorshipAuthorshipAuthorshipTopic signalAuthorshipAuthorshipAuthorshipAuthorshipAuthorshipWCovering Folded Shapespreprint / 2014AOswin AichholzerResearcherAGreg AloupisResearcherAErik D. DemaineResearcherAMartin L. DemaineResearcherTComputational Geometry1083 worksASándor P. FeketeResearcherAMichael HoffmannResearcherAAnna LubiwResearcherAJack SnoeyinkResearcherAAndrew WinslowResearcher
PaperSignal 1010 links

Covering Folded Shapes

preprint / 2014

Open