| dc.contributor.author | Korman, Matias | |
| dc.contributor.author | Mitchell, Joseph S. B. | |
| dc.contributor.author | Otachi, Yota | |
| dc.contributor.author | van Renssen, André | |
| dc.contributor.author | Roeloffzen, Marcel | |
| dc.contributor.author | Uehara, Ryuhei | |
| dc.contributor.author | Uno, Yushi | |
| dc.contributor.author | Demaine, Erik D | |
| dc.contributor.author | Ku, Jason S | |
| dc.date.accessioned | 2017-07-28T13:16:53Z | |
| dc.date.available | 2017-07-28T13:16:53Z | |
| dc.date.issued | 2016-11 | |
| dc.date.submitted | 2015-09 | |
| dc.identifier.isbn | 978-3-319-48531-7 | |
| dc.identifier.isbn | 978-3-319-48532-4 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.issn | 1611-3349 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/110865 | |
| dc.description.abstract | We study the complexity of symmetric assembly puzzles: given a collection of simple polygons, can we translate, rotate, and possibly flip them so that their interior-disjoint union is line symmetric? On the negative side, we show that the problem is strongly NP-complete even if the pieces are all polyominos. On the positive side, we show that the problem can be solved in polynomial time if the number of pieces is a fixed constant. | en_US |
| dc.language.iso | en_US | |
| dc.publisher | Springer International Publishing | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1007/978-3-319-48532-4_16 | 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 | arXiv | en_US |
| dc.title | Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Demaine, Erik D.; Korman, Matias; Ku, Jason S. et al. “Symmetric Assembly Puzzles Are Hard, Beyond a Few Pieces.” Discrete and Computational Geometry and Graphs (2016): 180–192 © 2016 Springer International Publishing | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
| dc.contributor.mitauthor | Demaine, Erik D | |
| dc.contributor.mitauthor | Ku, Jason S | |
| dc.relation.journal | Discrete and Computational Geometry and Graphs | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
| dspace.orderedauthors | Demaine, Erik D.; Korman, Matias; Ku, Jason S.; Mitchell, Joseph S. B.; Otachi, Yota; van Renssen, André; Roeloffzen, Marcel; Uehara, Ryuhei; Uno, Yushi | en_US |
| dspace.embargo.terms | N | en_US |
| dc.identifier.orcid | https://orcid.org/0000-0003-3803-5703 | |
| dc.identifier.orcid | https://orcid.org/0000-0002-9376-5584 | |
| mit.license | OPEN_ACCESS_POLICY | en_US |
