Skip to main content
SpringerLink
Log in

Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces

  • Conference paper
  • First Online:
Discrete and Computational Geometry and Graphs (JCDCGG 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9943))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Cayley, A.: A theorem on trees. Q. J. Math 23, 376–378 (1889)

    MATH  Google Scholar 

  2. Demaine, E.D., Demaine, M.L.: Jigsaw puzzles, edge matching, and polyomino packing: connections and complexity. Graphs Comb. 23(Suppl.), 195–208 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Fox-Epstein, E., Uehara, R.: The convex configurations of “Sei Shonagon Chie no Ita" and other dissection puzzles. In: 26th Canadian Conference on Computational Geometry (CCCG), pp. 386–389 (2014)

    Google Scholar 

  4. Iwase, N.: Symmetrix. In: 24th International Puzzle Party (IPP 24), p. 54. IPP24 Committee (2005, unpublished)

    Google Scholar 

  5. Slocum, J.: The Tangram Book: The Story of the Chinese Puzzle with over Puzzle to Solve. Sterling Publishing, New York (2000)

    Google Scholar 

  6. Wolter, J.D., Woo, T.C., Volz, R.A.: Optimal algorithms for symmetry detection in two and three dimensions. Vis. Comput. 1(1), 37–48 (1985)

    Article  MATH  Google Scholar 

  7. Yamamoto, H.: Personal communication (2014)

    Google Scholar 

Download references

Acknowledgements

Many of the authors were introduced to symmetric assembly puzzles during the 30th Winter Workshop on Computational Geometry at the Bellairs Research Institute of McGill University, March 2015. Korman is supported in part by the ELC project (MEXT KAKENHI No. 24106008). Mitchell is supported in part by the National Science Foundation (CCF-1526406). Uno is supported in part by the ELC project (MEXT KAKENHI No. 15H00853).

Author information

Authors and Affiliations

  1. MIT, Cambridge, USA

    Erik D. Demaine & Jason S. Ku

  2. Tohoku University, Sendai, Japan

    Matias Korman

  3. Stony Brook University, Stony Brook, USA

    Joseph S. B. Mitchell

  4. JAIST, Nomi, Japan

    Yota Otachi & Ryuhei Uehara

  5. National Institute of Informatics, Tokyo, Japan

    André van Renssen & Marcel Roeloffzen

  6. JST, ERATO, Kawarabayashi Large Graph Project, Tokyo, Japan

    André van Renssen & Marcel Roeloffzen

  7. Osaka Prefecture University, Sakai, Japan

    Yushi Uno

Authors
  1. Erik D. Demaine
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matias Korman
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jason S. Ku
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Joseph S. B. Mitchell
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Yota Otachi
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. André van Renssen
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Marcel Roeloffzen
    View author publications

    You can also search for this author in PubMed Google Scholar

  8. Ryuhei Uehara
    View author publications

    You can also search for this author in PubMed Google Scholar

  9. Yushi Uno
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jason S. Ku .

Editor information

Editors and Affiliations

  1. Tokyo University of Science , Tokyo, Japan

    Jin Akiyama

  2. The University of Electro-Communications , Tokyo, Japan

    Hiro Ito

  3. Tokai University , Tokyo, Japan

    Toshinori Sakai

  4. Osaka Prefecture University , Sakai, Japan

    Yushi Uno

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Demaine, E.D. et al. (2016). Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces. In: Akiyama, J., Ito, H., Sakai, T., Uno, Y. (eds) Discrete and Computational Geometry and Graphs. JCDCGG 2015. Lecture Notes in Computer Science(), vol 9943. Springer, Cham. https://doi.org/10.1007/978-3-319-48532-4_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-48532-4_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-48531-7

  • Online ISBN: 978-3-319-48532-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation