Two posts by Evelyn Lamb about the theorem that you can make any shape by folding+one cut, and a fold+cut alphabet by Erik and Marty Demaine and Katie Steckles: https://blogs.scientificamerican.com/roots-of-unity/the-queen-of-the-fold-and-cut-alphabet/ and https://blogs.scientificamerican.com/roots-of-unity/make-your-own-font-1-cut-at-a-time/

Small peeve: Lamb and Steckles omit credit for some theorem authors, particularly Lubiw.

If you want to design your own, the disk packing method is implemented at http://jorigami.sourceforge.net/ but I think the straight skeleton method produces prettier folding patterns.

Jeff Erickson@jeffgerickson@mathstodon.xyz@11011110 I have a different peeve: E. Demaine, M. Demaine, and Lubiw didn't actually prove the Fold and Cut theorem! Their straight-skeleton-based algorithm doesn't necessarily yield a finite number of folds, thanks to the possibility of "dense spiraling". (See Figure 17.10 in Geometric Folding Algorithms.) The first actual *proof* is your circle-packing argument with Bern, E. Demaine, and Hayes (1998), with some bugs corrected by E. Demaine and O'Rourke in (2006).