This is a python toolkit with useful functions for the study of kirigami and other foldable structures developed at the Center for Theoretical and Computational Physics (CFTC). The code here provided allows to probe the configurational landscape of a kirigami folding given a graph description of both its initial and final structures (for example template and polyhedra). A complete description of the problem we are aiming to solve and the code behind it can be found at [arxiv link].
The code uses two different types of inputs, one in .json format from the database created by Dodd et al [1] and the other as .txt files, these files were created by exploiting the results of the optimal net search algorithm developed by Araújo et al [2].
[1] P. M. Dodd, P. F. Damasceno, and S. C. Glotzer, Universal folding pathways of polyhedron nets, Proceedings of the National Academy of Sciences 115(29), E6690–E6696 (2018). https://doi.org/10.1073/pnas.1722681115
[2] N. A. M. Araújo, R. A. da Costa, S. N. Dorogovtsev, and J. F. F. Mendes, Finding the Optimal Nets for Self-Folding Kirigami, Physical Review Letters 120, 188001 (2018). https://doi.org/10.1103/PhysRevLett.120.188001