2026-09-19T16:21:20Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/626672022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Erik D. Demaine.
Ovadya, Aviv
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2011-05-09T15:16:56Z
2011-05-09T15:16:56Z
2010
2010
http://hdl.handle.net/1721.1/62667
714239408
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 57) and index.
We investigate a new approach to origami design using simple universal hinge patterns where the crease patterns for different shapes are just different subsets of a common hinge pattern. Several algorithms have previously been developed to design folded states for particular shapes, but they require a different crease pattern for each shape. Our motivations include the development of robotic "origami transformers," artistic tools, and theoretical insights. We show how to compose "cube gadgets" to fold any N-cube polycube from an O(N) x O(N) rectangle of paper, using only O(N 2 ) time to compute the parameters of the unambiguous folding sequence. We also describe extensions of our basic algorithm to larger classes of shapes with improved paper efficiency. Finally, we demonstrate that an implementation of this technique can actually be used to partially automate geometric paper folding.
by Aviv Ovadya.
M.Eng.
61 p.
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Origami transformers : folding orthogonal structures from universal hinge patterns
Folding orthogonal structures from universal hinge patterns
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="4264d8e5-2a9e-40c8-a0b1-03016c56aabe">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Origami transformers : folding orthogonal structures from universal hinge patterns</Title>
<Subtitle>Folding orthogonal structures from universal hinge patterns</Subtitle>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2010</PublicationDate>
<Authors>
<Author>
<DisplayName>Ovadya, Aviv</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>We investigate a new approach to origami design using simple universal hinge patterns where the crease patterns for different shapes are just different subsets of a common hinge pattern. Several algorithms have previously been developed to design folded states for particular shapes, but they require a different crease pattern for each shape. Our motivations include the development of robotic "origami transformers," artistic tools, and theoretical insights. We show how to compose "cube gadgets" to fold any N-cube polycube from an O(N) x O(N) rectangle of paper, using only O(N 2 ) time to compute the parameters of the unambiguous folding sequence. We also describe extensions of our basic algorithm to larger classes of shapes with improved paper efficiency. Finally, we demonstrate that an implementation of this technique can actually be used to partially automate geometric paper folding.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>