Geometric folding algorithms : linkages, origami, polyhedra /
Did you know that any straight-line drawing on paper can be folded so that the complete drawing can be cut out with one straight scissors cut? That there is a planar linkage that can trace out any algebraic curve, or even 'sign your name'? Or that a 'Latin cross' unfolding of a c...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Cambridge :
Cambridge University Press,
2007.
|
| Subjects: | |
| Online Access: | CONNECT |
Table of Contents:
- Introduction
- pt. 1. Linkages. Problem classification and examples
- Upper and lower bounds
- Planar linkage mechanisms
- Rigid frameworks
- Reconfiguration of chains
- Locked chains
- Interlocked chains
- Joint-constrained motion
- Protein folding
- pt. 2. Paper. Introduction
- Foundations
- Simple crease patterns
- General crease patterns
- Map folding
- Silhouettes and gift wrapping
- The tree method
- One complete straight cut
- Flattening polyhedra
- Geometric constructibility
- Rigid origami and curved creases
- pt. 3. Polyhedra. Introduction and overview
- Edge unfolding of polyhedra
- Reconstruction of polyhedra
- Shortest paths and geodesics
- Folding polygons to polyhedra
- Higher dimensions.
