| dc.contributor.author | Akiyama, Jin | |
| dc.contributor.author | Demaine, Erik D | |
| dc.contributor.author | Langerman, Stefan | |
| dc.date.accessioned | 2021-12-17T17:05:56Z | |
| dc.date.available | 2021-09-20T17:30:20Z | |
| dc.date.available | 2021-12-17T17:05:56Z | |
| dc.date.issued | 2019-05 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/131807.2 | |
| dc.description.abstract | We prove that two polygons A and B have a reversible hinged dissection (a chain hinged dissection that reverses inside and outside boundaries when folding between A and B) if and only if A and B are two noncrossing nets of a common polyhedron. Furthermore, monotone reversible hinged dissections (where all hinges rotate in the same direction when changing from A to B) correspond exactly to noncrossing nets of a common convex polyhedron. By envelope/parcel magic, it becomes easy to design many hinged dissections. | en_US |
| dc.publisher | Springer Japan | en_US |
| dc.relation.isversionof | https://doi.org/10.1007/s00373-019-02041-2 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
| dc.source | Springer Japan | en_US |
| dc.title | Polyhedral Characterization of Reversible Hinged Dissections | en_US |
| dc.type | Article | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
| eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
| dc.date.updated | 2020-09-24T20:43:45Z | |
| dc.language.rfc3066 | en | |
| dc.rights.holder | Springer Japan KK, part of Springer Nature | |
| dspace.embargo.terms | Y | |
| dspace.date.submission | 2020-09-24T20:43:45Z | |
| mit.license | OPEN_ACCESS_POLICY | |
| mit.metadata.status | Publication Information Needed | en_US |
