Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces
Name
Symmetric assembly puzzles are hard, beyond a few pieces.pdf
Size
481.91 KB
Format
Adobe PDF
Checksum (MD5)
0e08b2b09063349db493575386d95cc6
Author(s)
Korman, Matias
Mitchell, Joseph S. B.
Otachi, Yota
van Renssen, André
Roeloffzen, Marcel
Uehara, Ryuhei
Uno, Yushi
Demaine, Erik D
Ku, Jason S
Date Issued
November 2016
Journal
Discrete and Computational Geometry and Graphs
Publisher
Springer International Publishing
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
Version
Author's final 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-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-319-48532-4_16
