Scribd
Upload
49 views

Problem Set 3: 6.849: Geometric Folding Algorithms Fall 2012 - Prof. Erik Demaine

This document provides the problem set for the course 6.849: Geometric Folding Algorithms. It includes 4 problems: 1) design and fold an origami piece using software and submit the physical piece, 2) prove a mathematical property about the folding angles of a degree-4 vertex in origami, 3) design a maze folding using an online app and share the link, 4) prove that optimizing the length of a 1D folded paper with a given crease pattern is NP-hard.

Uploaded by

Orlando Alvarez
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
49 views

Problem Set 3: 6.849: Geometric Folding Algorithms Fall 2012 - Prof. Erik Demaine

This document provides the problem set for the course 6.849: Geometric Folding Algorithms. It includes 4 problems: 1) design and fold an origami piece using software and submit the physical piece, 2) prove a mathematical property about the folding angles of a degree-4 vertex in origami, 3) design a maze folding using an online app and share the link, 4) prove that optimizing the length of a 1D folded paper with a given crease pattern is NP-hard.

Uploaded by

Orlando Alvarez
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

6.

849: Geometric Folding Algorithms


Fall 2012 — Prof. Erik Demaine,

Problem Set 3

Due: Tuesday, October 2nd, 2012

We will drop (ignore) your lowest score on any one problem.

Problem 1. Design and fold a piece of origami using Tomohiro Tachi’s Freeform Origami software
or Alex Bateman’s Tess. Submit the physical folded piece in class with your name on it, and send
a digital copy of the crease pattern.

• Freeform Origami can be downloaded from http://www.tsg.ne.jp/TT/software/#ffo


(Windows only. If you do not have a Windows machine, use a Windows Athena cluster, e.g.,
in building 37-3.)

• Tess can be downloaded from http://www.papermosaics.co.uk/software.html


(Requires Perl/Tk, or use the Windows binary.)

ρ2,3
Problem 2. Given a flat-foldable degree-4 vertex, we ρ1,2
can represent its configuration in 3D space by the four an-
gles between the creases (θ1 , θ2 , θ3 , θ4 ) and by four fold-
ing angles (ρ1,2 , ρ2,3 , ρ3,4 , ρ4,1 ), as shown on the right. We θ2
measure a folding angle between −180◦ and 180◦ : a fold- θ1
θ3
ing angle of 0 indicates no folding, while a folding angle of θ4 ρ4,1
±180◦ indicates a mountain/valley flat fold. Prove that,
for any 3D configuration of a flat-foldable degree-4 vertex,
|ρ1,2 | = |ρ3,4 | and |ρ2,3 | = |ρ4,1 |. (For the mountain-valley
assignment in the figure, ρ1,2 = ρ3,4 and ρ2,3 = −ρ4,1 .) ρ3,4
Hint: Use spherical trigonometry.

Problem 3. Make a cool maze-folding design using the following webapp:

http://erikdemaine.org/fonts/maze/

Email us a link to your design using the “link to this view” feature. You do not need to fold this
piece. If you decide to try folding it, we will expect a much less complex design.

Problem 4. Prove that the following problem is NP-hard:

Given a 1D piece of paper with a 1D crease pattern, find the subset of creases to fold
that produces the smallest length of the resulting flat folding.

Note that not all creases need to be folded and there is no mountain-valley assignment.
Hint: Reduce from Partition.

1
MIT OpenCourseWare
http://ocw.mit.edu

6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra


Fall 2012

For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.

You might also like