Funder
National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference11 articles.
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)
2. Assis, M.: Exactly solvable flat-foldable quadrilateral origami tilings. Phys. Rev. E 98, 032112 (2018). https://doi.org/10.1103/PhysRevE.98.032112
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)
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