Full Imposition Support algorithm development

[HYUNSEONG-KIM]

Current

v 0.0.2
Current imposition routine

• Standard imposition, $2^n$ leaves : Generation algorithm is implemented
• 6, 12 leaves : Supported as pefixed setting

Further Plan

For perpendicular and parallel creasing patterns of paper, its right order layout algorithm will be implemneted.
Thus, all kinds of sections folding types will be supported if they are possible, physically.

Review of previous studies

Determining such works are proved as NP-Hard problem if we started from creasing pattern of the paper.
Without loss of generality, we will start from fold sequence. It is not only enough for representing all types of section folding, at least equivalent, moreover, this makes us to avoid such NP-Hard probelm in implmentation and to focus on real layout algorithm development.

Resources

• Y Jia, J Mitani, R Uehara, 2020, Valid orderings of layers when simple-folding a map, Journal of Inofrmation Processing.
• Erik D. Demaine, Joseph O'Rourke, Geometric Folding Algorthms: Linkages, Origami, Polyhedra, Cambridge University Press, 2007.
• Lang, Robert J, Twists, tilings, and tessellations : mathematical methods for geometric origami

[HYUNSEONG-KIM]

The section composition class, SecComposition, was provided in section.py with Section class, but new routines and methods will be seperated to independent file. Furthermore, it can be published to standalone library in future.