Skip to main content
SpringerLink
Log in

Generalization of Haberdasher’s Puzzle

  • Published:
Discrete & Computational Geometry Aims and scope Submit manuscript

Abstract

In this paper, we scrutinize the Haberdasher’s puzzle by Dudeney to produce equi-rotational pairs of figures systematically. We also generalize the puzzle by considering the tessellability condition (strong tessellability) for a pair of figures. As a result of it, it is shown that all pairs of strong tessellative and equi-rotational figures satisfy Conway criterion.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26
Fig. 27
Fig. 28
Fig. 29

Similar content being viewed by others

References

  1. Akiyama, J., Langerman, S., Matsunaga, K.: Reversible nets of polyhedra. In: Akiyama, J., Ito, H., Sakai, T. (eds.) Discrete and Computational Geometry and Graphs. Lecture Note in Computer Science, vol. 9943, pp. 13–23. Springer, Berlin (2016)

    Chapter  Google Scholar 

  2. Akiyama, J., Nakamura, G.: Dudeney dissections of polygons. In: Akiyama, J., Kano, M., Urabe, M. (eds.) Discrete and Computational Geometry. Lecture Notes in Computer Science, vol. 1763, pp. 14–29. Springer, Berlin (2000)

    Chapter  Google Scholar 

  3. Akiyama, J., Nakamura, G.: Congruent Dudeney dissections of triangles and convex quadrilaterals—all hinge points interior to the sides of the polygons. In: Aronov, B., et al. (eds.) Discrete and Computational Geometry. Algorithms and Combinatorics, vol. 25, pp. 43–63. Springer, Berlin (2003)

    Chapter  Google Scholar 

  4. Akiyama, J., Nakamura, G.: Congruent Dudeney dissections of polygons. All the hinge points on vertices of the polygon. In: Akiyama, J., Kano, M. (eds.) Discrete and Computational Geometry. Lecture Notes in Computer Science, vol. 2866, pp. 14–21. Springer, Berlin (2003)

    Chapter  Google Scholar 

  5. Akiyama, J., Rappaport, D., Seong, H.: A decision algorithm for reversible pairs of polygons. Discrete Appl. Math. 178, 19–26 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  6. Akiyama, J., Seong, H.: A criterion for a pair of convex polygons to be reversible. Graphs Comb. 31(2), 347–360 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  7. Conway Criterion. http://en.wikipedia.org/wiki/Conway_criterion (this page was last modified on 8 Aug 2015, at 19:27)

  8. Dudeney, H.E.: The Canterbury Puzzles and Other Curious Problems. W. Heinemann, London (1907)

    Google Scholar 

  9. Frederickson, G.N.: Dissections: Plane and Fancy. Cambridge University Press, Cambridge (1997)

    Book  MATH  Google Scholar 

  10. Schattschneider, D.: Will it tile? Try the Conway criterion!. Math. Mag. 53(4), 224–233 (1980)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tokyo University of Science, 1-3 Kagurazaka, Shinjuku, Tokyo, 162-8601, Japan

    Jin Akiyama & Kiyoko Matsunaga

Authors
  1. Jin Akiyama
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kiyoko Matsunaga
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jin Akiyama.

Additional information

Editor in Charge: János Pach

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Akiyama, J., Matsunaga, K. Generalization of Haberdasher’s Puzzle. Discrete Comput Geom 58, 30–50 (2017). https://doi.org/10.1007/s00454-017-9876-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00454-017-9876-9

Keywords

Search

Navigation