WOLFRAM|DEMONSTRATIONS PROJECT

Shephard's Algorithm for Two Convex Polyhedra with a Common Net

​
b
2.5
fold or unfold
0
The same net can be folded up into two different convex polyhedra.