| dc.contributor.author | Demaine, Erik D | |
| dc.contributor.author | Ku, Jason S | |
| dc.date.accessioned | 2020-12-11T14:31:53Z | |
| dc.date.available | 2020-12-11T14:31:53Z | |
| dc.date.issued | 2020-10 | |
| dc.identifier.issn | 0925-7721 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/128811 | |
| 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 | |
| dc.publisher | Elsevier BV | en_US |
| dc.relation.isversionof | 10.1016/J.COMGEO.2020.101648 | en_US |
| dc.rights | Creative Commons Attribution-NonCommercial-NoDerivs License | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/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. et al. “Symmetric assembly puzzles are hard, beyond a few pieces.” Computer methods in applied mechanics and engineering, 90 (October 2020): 101648 © 2020 The Author(s) | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
| dc.relation.journal | Computational Geometry: Theory and Applications | en_US |
| dc.eprint.version | Original manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
| eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
| dc.date.updated | 2020-12-09T17:27:36Z | |
| dspace.orderedauthors | Demaine, ED; Korman, M; Ku, JS; Mitchell, JSB; Otachi, Y; van Renssen, A; Roeloffzen, M; Uehara, R; Uno, Y | en_US |
| dspace.date.submission | 2020-12-09T17:27:42Z | |
| mit.journal.volume | 90 | en_US |
| mit.license | PUBLISHER_CC | |
| mit.metadata.status | Complete | |
