Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces

DOI10.1007/978-3-319-48532-4_16zbMath1482.05034arXiv1703.02671OpenAlexW3148446783MaRDI QIDQ2958100

Yota Otachi, André van Renssen, Ryuhei Uehara, Jason S. Ku, Joseph S. B. Mitchell, Marcel Roeloffzen, Yushi Uno, Erik D. Demaine, Matias Korman

Publication date: 1 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.02671

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial aspects of packing and covering (05B40) Polyominoes (05B50)

Related Items (2)

Twenty years of progress of \(\mathrm{JCDCG}^3\) ⋮ Permutable symmetric Hadamard matrices in quaternion algebra and engineering applications

Cites Work

• Optimal algorithms for symmetry detection in two and three dimensions
• Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity

This page was built for publication: Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces