dc.contributor.author | Demaine, Erik D. | |
dc.contributor.author | Demaine, Martin L. | |
dc.contributor.author | Hart, Vi | |
dc.contributor.author | Iacono, John | |
dc.contributor.author | Langerman, Stefan | |
dc.contributor.author | O'Rourke, Joseph | |
dc.date.accessioned | 2011-12-08T17:56:00Z | |
dc.date.available | 2011-12-08T17:56:00Z | |
dc.date.issued | 2011-05 | |
dc.identifier.issn | 1435-5914 | |
dc.identifier.issn | 0911-0119 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/67481 | |
dc.description.abstract | We construct the first two continuous bloomings of all convex polyhedra. First, the source unfolding can be continuously bloomed. Second, any unfolding of a convex polyhedron can be refined (further cut, by a linear number of cuts) to have a continuous blooming. | en_US |
dc.language.iso | en_US | |
dc.publisher | Springer-Verlag | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1007/s00373-011-1024-3 | en_US |
dc.rights | Creative Commons Attribution-Noncommercial-Share Alike 3.0 | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/ | en_US |
dc.source | MIT web domain | en_US |
dc.title | Continuous Blooming of Convex Polyhedra | en_US |
dc.type | Article | en_US |
dc.identifier.citation | Demaine, Erik D. et al. “Continuous Blooming of Convex Polyhedra.” Graphs and Combinatorics 27 (2011): 363-376. Web. 8 Dec. 2011. | 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.contributor.approver | Demaine, Erik D. | |
dc.contributor.mitauthor | Demaine, Erik D. | |
dc.contributor.mitauthor | Demaine, Martin L. | |
dc.relation.journal | Graphs and Combinatorics | 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 |
dspace.orderedauthors | Demaine, Erik D.; Demaine, Martin L.; Hart, Vi; Iacono, John; Langerman, Stefan; O’Rourke, Joseph | en |
dc.identifier.orcid | https://orcid.org/0000-0003-3803-5703 | |
mit.license | OPEN_ACCESS_POLICY | en_US |
mit.metadata.status | Complete | |