Unfolding Polyhedra
Computational Geometry
2019-08-21 v1
Abstract
Starting with the unsolved "D\"urer'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.
Keywords
Cite
@article{arxiv.1908.07152,
title = {Unfolding Polyhedra},
author = {Joseph O'Rourke},
journal= {arXiv preprint arXiv:1908.07152},
year = {2019}
}
Comments
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