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

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

SNAPSHOTS

  • [Snapshot]
  • [Snapshot]
  • [Snapshot]

DETAILS

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.
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.