An Unfoldable Polyhedron
Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
To unfold a polyhedron, cut it along some edges and flatten it out to form a net. (Allowing cuts on faces as well as edges is called a general unfolding.)[more]
This Demonstration shows a "spiked tetrahedron" of Bern et al. . It can only be unfolded with overlaps since one quarter of it (a "hat") can be unfolded only with overlaps.[less]
Contributed by: Izidor Hafner (August 2016)
Open content licensed under CC BY-NC-SA
In  a polyhedron that can be edge-unfolded only with overlaps, is called an unfoldable polyhedron. The proof of the unfoldability of the spiked tetrahedron can be found in .
 M. Bern, E. D. Demaine, D. Eppstein and E. Kuo, "Ununfoldable Polyhedra," in Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), Vancouver, 1999 pp. 13-16. www.cccg.ca/proceedings/1999/fp38.pdf.
 E. D. Demaine and J. O'Rourke, Geometric Folding Algorithms: Linkages, Origami, Polyhedra, New York: Cambridge University Press, 2007, pp. 318–320.
"An Unfoldable Polyhedron"
Wolfram Demonstrations Project
Published: August 9 2016