Skip to main content

Crystallographic Flat Origami from n-Uniform Tilings

  • Conference paper
  • First Online:

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

Abstract

This paper discusses the symmetry properties of crystallographic flat origami arising from n-uniform tilings using the hinged tiling method. A flat origami invariant under a plane crystallographic group is called a crystallographic flat origami. An n-uniform tiling is a tiling consisting of regular polygons, with the property that its vertices form n transitivity classes under the action of its symmetry group.

The authors would like to thank the Ateneo de Manila University for the support through the Loyola Schools Scholarly Work Grant.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   44.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.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

Learn about institutional subscriptions

References

  1. Bateman, A.: Computer tools and algorithms for origami tessellation design. In: Hull, T. (ed.) Origami\(^3\): Third International Meeting of Origami Science, Math, and Education, pp. 121–127. CRC Press, Florida (2002)

    Google Scholar 

  2. Bern, M., Hayes, B.: The complexity of flat origami. In: Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 175–183. Atlanta, Georgia (1996)

    Google Scholar 

  3. De Las Peñas, M. L. A., Taganap, E., Rapanut, T.: Color symmetry approach to the construction of crystallographic flat origami. In: Miura, K., et al. (eds.) Origami 6: I. Mathematics, pp. 11–20 (2015)

    Google Scholar 

  4. The GAP Group, GAP - Groups, Algorithms, and Programming, Version 4.7.7 (2015). (http://www.gap-system.org)

  5. Hahn, T. (ed.): International tables for crystallography, Vol. A, Space-Group Symmetry, 5th ed. Springer, Heidelberg (2005)

    Google Scholar 

  6. Hull, T.: On the mathematics of flat origamis. Congr. Numer. 100, 215–224 (1994)

    MathSciNet  MATH  Google Scholar 

  7. Hull, T.: Counting Mountain-valley assignments for flat folds. Ars Comb. 67, 175–188 (2003)

    MathSciNet  MATH  Google Scholar 

  8. Justin, J.: Toward a mathematical theory of origami. In: Miura, K. (ed.) Origami Science and Art: Proceedings of the Second International Meeting of Origami Science and Scientific Origami, pp. 15–29, Seian University of Art and Design, Otsu, Japan (1997)

    Google Scholar 

  9. Kawasaki, T.: On the relation between mountain-creases and valley-creases of a flat origami (abridged English translation) In: Huzita, H. (ed.) Proceedings of the First International Meeting of Origami Science and Technology, pp. 229–237. Ferrara, Italy (1989)

    Google Scholar 

  10. Kawasaki, T.: Roses, Origami & Math. Japan Publications, Tokyo, Japan (2005)

    Google Scholar 

  11. Kawasaki, T., Yoshida, M.: Crystallographic flat origamis. Mem. Fac. Sci. Kyushu Univ. Ser. A 42(2), 153–157 (1988)

    Google Scholar 

  12. Kasahara, K.: Origami Omnibus, p. 96. Japan Publications, Tokyo, Japan (1988)

    Google Scholar 

  13. Kasahara, K., Takahama, T.: Origami for the Connoisseur, p. 29. Japan Publications, Tokyo (1987)

    Google Scholar 

  14. Lang, R.: Twists, Tilings and Tessellations: Mathematical Methods for Geometric Origami, pp. 236, 287. CRC Press, Florida, USA (2018)

    Google Scholar 

  15. Lang, R., Bateman, A.: Every spider web has a simple flat twist tessellation. In: Wang-Iverson, P., et al. (eds.) Origami\(^5\) : Fifth International Meeting of Origami Science. Mathematics and Education, pp. 455–474. CRC Press, Florida (2010)

    Google Scholar 

  16. Maekawa, J.: The definition of Iso-Area folding. In: Hull, T. (ed.) Origami\(^3\): Proceedings of the Third International Meeting on Origami Science, Mathematics and Education, pp. 53–58. A.K. Peters Ltd., Natick, MA (2002)

    Google Scholar 

  17. Sales, R.E.R.: On the Crystallographic Flat Origami. Ph.D. Dissertation, University of the Philippines Diliman, October 2000

    Google Scholar 

  18. Say-awen, A. L., De Las Peñas, M. L. A., Rapanut, T.: On color fixing groups associated with colored symmetrical tilings. In: Proceedings of the 3rd International Conference on Mathematical Sciences, pp. 050012-1-050012–10 (2014)

    Google Scholar 

  19. Taganap, E., De Las Peñas, M. L. A., Rapanut, T.: Crystallographic flat origami with three flat foldability types of the generating unit. In: Proceedings of the 3rd International Conference on Mathematical Sciences, pp. 662–667 (2014)

    Google Scholar 

  20. Verrill, H.: Origami tessellations. In: Sarhangi, R. (ed.) Conference Proceedings of Bridges: Mathematical Connections in Art, Music and Science, pp. 55–68 (1998)

    Google Scholar 

  21. Wang-Iverson, P., Lang, R., Yang, M. (eds.): Origami\(^5\): Fifth International Meeting of Origami Science. Mathematics and Education, pp. 455–474. CRC Press, Florida (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ma. Louise Antonette N. De Las Peñas .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

De Las Peñas, M.L.A.N., Taganap, E.C. (2021). Crystallographic Flat Origami from n-Uniform Tilings. In: Akiyama, J., Marcelo, R.M., Ruiz, MJ.P., Uno, Y. (eds) Discrete and Computational Geometry, Graphs, and Games. JCDCGGG 2018. Lecture Notes in Computer Science(), vol 13034. Springer, Cham. https://doi.org/10.1007/978-3-030-90048-9_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-90048-9_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-90047-2

  • Online ISBN: 978-3-030-90048-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics