Pages that link to "Geometric Folding Algorithms"

The following pages link to Geometric Folding Algorithms:

Showing 35 items.

• Bricard octahedron ‎ (links)
• Polyhedron ‎ (links)
• Joseph O'Rourke (professor) ‎ (links)
• NP-intermediate ‎ (links)
• Geometric Folding Algorithms (transclusion) ‎ (links)
• Geometric Folding Algorithms: Linkages, Origami, Polyhedra (redirect page) ‎ (links)
• Disphenoid ‎ (links)
• Steffen's polyhedron ‎ (links)
• Common net ‎ (links)
• List of books in computational geometry ‎ (links)
• Eve Torrence ‎ (links)
• List of books about polyhedra ‎ (links)
• Kempe's universality theorem ‎ (links)
• Kôdi Husimi ‎ (links)
• A History of Folding in Mathematics ‎ (links)
• List of unsolved problems in mathematics ‎ (links)
• Flexible polyhedron ‎ (links)
• Robert Connelly ‎ (links)
• Geometric Exercises in Paper Folding ‎ (links)
• Yoshizawa–Randlett system ‎ (links)
• Alfred Kempe ‎ (links)
• Star unfolding ‎ (links)
• Big-little-big lemma ‎ (links)
• Mathematics of paper folding ‎ (links)
• Huzita–Hatori axioms ‎ (links)
• Modular origami ‎ (links)
• Regular paperfolding sequence ‎ (links)
• Rigid origami ‎ (links)
• Toshikazu Kawasaki ‎ (links)
• Fold-and-cut theorem ‎ (links)
• Napkin folding problem ‎ (links)
• Martin Demaine ‎ (links)
• Erik Demaine ‎ (links)
• Dragon curve ‎ (links)
• Template:Mathematics of paper folding ‎ (links)