Sangam: A Confluence of Knowledge Streams

Universal hinge patterns for folding strips efficiently into any grid polyhedron

Show simple item record

dc.contributor Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.creator Demaine, Erik D
dc.creator Demaine, Martin L
dc.date 2021-02-22T15:36:23Z
dc.date 2021-02-22T15:36:23Z
dc.date 2020-08
dc.date 2017-09
dc.date 2020-12-09T18:08:57Z
dc.date.accessioned 2023-03-01T18:09:36Z
dc.date.available 2023-03-01T18:09:36Z
dc.identifier 0925-7721
dc.identifier https://hdl.handle.net/1721.1/129941
dc.identifier Benbernou, Nadia M. et al. “Universal hinge patterns for folding strips efficiently into any grid polyhedron.” Computational Geometry: Theory and Applications, 89 (August 2020): 101633 © 2020 The Author(s)
dc.identifier.uri http://localhost:8080/xmlui/handle/CUHPOERS/278975
dc.description We present two universal hinge patterns that enable a strip of material to fold into any connected surface made up of unit squares on the 3D cube grid—for example, the surface of any polycube. The folding is efficient: for target surfaces topologically equivalent to a sphere, the strip needs to have only twice the target surface area, and the folding stacks at most two layers of material anywhere. These geometric results offer a new way to build programmable matter that is substantially more efficient than what is possible with a square N×N sheet of material, which can fold into all polycubes only of surface area O(N) and may stack Θ(N2) layers at one point. We also show how our strip foldings can be executed by a rigid motion without collisions (albeit assuming zero thickness), which is not possible in general with 2D sheet folding. To achieve these results, we develop new approximation algorithms for milling the surface of a grid polyhedron, which simultaneously give a 2-approximation in tour length and an 8/3-approximation in the number of turns. Both length and turns consume area when folding a strip, so we build on past approximation algorithms for these two objectives from 2D milling.
dc.format application/pdf
dc.language en
dc.publisher Elsevier BV
dc.relation 10.1016/J.COMGEO.2020.101633
dc.relation Computational Geometry: Theory and Applications
dc.rights Creative Commons Attribution-NonCommercial-NoDerivs License
dc.rights http://creativecommons.org/licenses/by-nc-nd/4.0/
dc.source arXiv
dc.title Universal hinge patterns for folding strips efficiently into any grid polyhedron
dc.type Article
dc.type http://purl.org/eprint/type/JournalArticle


Files in this item

Files Size Format View
1611.03187.pdf 6.330Mb application/pdf View/Open

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse