Symmetric assembly puzzles are hard, beyond a few pieces
Name
1703.02671.pdf
Description
Submitted version
Size
673.84 KB
Format
Adobe PDF
Checksum (MD5)
737828e207a4afd1663878799da4843e
Author(s)
Demaine, Erik D
Ku, Jason S
Date Issued
October 2020
Journal
Computational Geometry: Theory and Applications
Publisher
Elsevier BV
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)
Version
Original manuscript
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-NonCommercial-NoDerivs License
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1016/J.COMGEO.2020.101648
