Unfolding Polyhedra
arXiv:1908.07152
Abstract
Starting with the unsolved "Dürer's problem" of edge-unfolding a convex polyhedron to a net, we specialize and generalize (a) the types of cuts permitted, and (b) the polyhedra shapes, to highlight both advances established and which problems remain open.
Proceedings 31st Canadian Conference on Computational Geometry, Aug 2019, Edmonton, Alberta. pp. 85-86. The arXiv version updates the proceedings version by citing a recent result that not every polycube can be edge-unzipped