Skip to main content

Counting Locally Flat-Foldable Origami Configurations Via 3-Coloring Graphs

Graphs and Combinatorics volume 37, pages 241–261 (2021)Cite this article

Abstract

Origami, where two-dimensional sheets are folded into complex structures, is rich with combinatorial and geometric structure, most of which remains to be fully understood. In this paper we consider flat origami, where the sheet of material is folded into a two-dimensional object, and consider the mountain (convex) and valley (concave) creases that result, called a MV assignment of the crease pattern. An open problem is to count the number locally valid MV assignments \(\mu \) of a given flat-foldable crease pattern C, where locally valid means that each vertex will fold flat under \(\mu \) with no self-intersections of the folded material. In this paper we solve this problem for a large family of crease patterns by creating a planar graph \(C^*\) whose 3-colorings are in one-to-one correspondence with the locally valid MV assignments of C. This reduces the problem of enumerating locally valid MV assignments to the enumeration of 3-colorings of graphs.

This is a preview of subscription content, access via your institution.

Access options

Buy single article

Instant access to the full article PDF.

USD 39.95

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

References

  1. Akitaya, H.A., Cheung, K.C., Demaine, E.D., Horiyama, T., Hull, T.C., Ku, J.S., Tachi, T., Uehara, R.: Box pleating is hard. In: Akiyama, J., Ito, H., Sakai, T., Uno, Y. (eds.) Discrete and Computational Geometry and Graphs, pp. 167–179. Springer, Cham (2016)

    Chapter  Google Scholar 

  2. Assis, M.: Exactly solvable flat-foldable quadrilateral origami tilings. Phys. Rev. E 98, 032112 (2018). https://doi.org/10.1103/PhysRevE.98.032112

    Article  MathSciNet  Google Scholar 

  3. Bern, M., Hayes, B.: The complexity of flat origami. In: Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, Philadelphia, pp. 175–183 (1996)

  4. Demaine, E.D., O’Rourke, J.: Geometric Folding Algorithms: Linkages, Origami. Polyhedra. Cambridge University Press, Cambridge (2007)

    Book  Google Scholar 

  5. Evans, T.A., Lang, R.J., Magleby, S.P., Howell, L.L.: Rigidly foldable origami gadgets and tessellations. R. Soc. Open Sci. 2(9), 150067 (2015). https://doi.org/10.1098/rsos.150067

    Article  MathSciNet  Google Scholar 

  6. Francesco, P.D.: Folding and coloring problems in mathematics and physics. Bull. Am. Math. Soc. 37, 251–307 (2000)

    Article  MathSciNet  Google Scholar 

  7. Ginepro, J., Hull, T.C.: Counting Miura-ori foldings. J. Integer Seq. 17(10), Article 14.10.8 (2014)

  8. Hull, T.C.: The combinatorics of flat folds: a survey. In: Origami\(^3\): Third International Meeting of Origami Science, Mathematics, and Education. A K Peters, Natick, pp. 29–38 (2002)

  9. Hull, T.C.: Counting mountain-valley assignments for flat folds. Ars Combinatoria 67, 175–188 (2003)

    MathSciNet  MATH  Google Scholar 

  10. Mitani, J.: (ORIPA) (Development of origami pattern editor (ORIPA) and a method for estimating a folded configuration of origami from the crease cattern, in Japanese). (Information Processing Society of Japan (IPSJ)) 48(9), 3309–3317 (2007)

  11. Ouchi, K., Uehara, R.: Efficient enumeration of flat-foldable single vertex crease patterns. IEICE Trans. Inf. Syst. E102.D(3), 416–422 (2019). https://doi.org/10.1587/transinf.2018FCP0004

Download references

Acknowledgements

This material is based upon work supported by the National Science Foundation under Grant number DMS-1851842, the MathILy-EST Research Experience for Undergraduates, under the direction in 2019 of the third author. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation. The authors wish to thank Bryn Mawr College for providing excellent hospitality and facilities for conducting this work.

Author information

Authors and Affiliations

  1. Georgia Institute of Technology, Atlanta, GA, USA

    Alvin Chiu

  2. Swarthmore College, Swarthmore, PA, USA

    William Hoganson

  3. Western New England University, Springfield, MA, USA

    Thomas C. Hull

  4. Clemson University, Clemson, SC, USA

    Sylvia Wu

Authors
  1. Alvin Chiu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. William Hoganson
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Thomas C. Hull
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sylvia Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Thomas C. Hull.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Chiu, A., Hoganson, W., Hull, T.C. et al. Counting Locally Flat-Foldable Origami Configurations Via 3-Coloring Graphs. Graphs and Combinatorics 37, 241–261 (2021). https://doi.org/10.1007/s00373-020-02240-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-020-02240-2

Keywords

  • Graph coloring
  • Origami

Mathematics Subject Classification

  • 05C15
  • 52C99