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

Initializing live version

The same net can be folded up into two different convex polyhedra.

Contributed by: Izidor Hafner (July 2020)
Open content licensed under CC BY-NC-SA

Snapshots

This Demonstration is based on Figure 25.8 [1, p. 389], which is attributed to Shephard [2].

Reference

[1] E. D. Demaine and J. O'Rourke, Geometric Folding Algorithms: Linkages, Origami, Polyhedra, New York: Cambridge University Press, 2007.

[2] G. C. Shephard, "Convex Polytopes with Convex Nets." Mathematical Proceedings of the Cambridge Philosophical Society, 78, 1975 pp. 389–403.


Feedback (field required)

Email (field required)	Name

Occupation	Organization

Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback. Send