perimeter 2 n2 + O(n)
[Demaine, Demaine, Konjevod, Lang 2009]
Courtesy of Erik D. Demaine, Martin L. Demaine, Goran Konjevod, and Robert J. Lang. Used with permission.
10
[Demaine, Demaine, Konjevod, Lang 2009]
perimeter n2 + O(n)
Courtesy of Erik D. Demaine, Martin L. Demaine, Goran Konjevod, and Robert J. Lang. Used with permission.
11
[Demaine, Demaine, Konjevod, Lang 2009]
perimeter n2 + O(n)
Courtesy of Erik D. Demaine, Martin L. Demaine, Goran Konjevod, and Robert J. Lang. Used with permission.
12
Demaine & Tachi 2010
Courtesy of Erik D. Demaine, Martin L. Demaine, Goran Konjevod, and Robert J. Lang. Used with permission.
13
Demaine & Tachi 2010Courtesy of Erik D. Demaine, Martin L. Demaine, Goran Konjevod, and Robert J. Lang. Used with permission.
14
Demaine & Tachi 2010
Courtesy of Erik D. Demaine, Martin L. Demaine, Goran Konjevod, and Robert J. Lang. Used with permission.
15
Demaine & Tachi 2010
Courtesy of Erik D. Demaine, Martin L. Demaine, Goran Konjevod, and Robert J. Lang. Used with permission.
16
Demaine & Tachi 2010
Courtesy of Erik D. Demaine, Martin L. Demaine, Goran Konjevod, and Robert J. Lang. Used with permission.
17
MIT OpenCourseWarehttp://ocw.mit.edu
6.849 Geometric Folding Algorithms: Linkages, Origami, PolyhedraFall 2012
For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.