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 ! R2). 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.
Originalsprache | englisch |
---|---|
Seiten (von - bis) | 150-168 |
Seitenumfang | 6 |
Fachzeitschrift | Journal of Computational Geometry |
Jahrgang | 5 |
Ausgabenummer | 1 |
DOIs | |
Publikationsstatus | Veröffentlicht - 2014 |
Veranstaltung | 25th Canadian Conference on Computational Geometry: CCCG 2013 - Waterloo, Kanada Dauer: 8 Aug. 2013 → 10 Aug. 2013 |
ASJC Scopus subject areas
- Geometrie und Topologie
- Computational Mathematics
Fields of Expertise
- Information, Communication & Computing
Treatment code (Nähere Zuordnung)
- Basic - Fundamental (Grundlagenforschung)