Open Access
2014 Affine unfoldings of convex polyhedra
Mohammad Ghomi
Geom. Topol. 18(5): 3055-3090 (2014). DOI: 10.2140/gt.2014.18.3055

Abstract

We show that every convex polyhedron admits a simple edge unfolding after an affine transformation. In particular, there exists no combinatorial obstruction to a positive resolution of Dürer’s unfoldability problem, which answers a question of Croft, Falconer and Guy. Among other techniques, the proof employs a topological characterization of embeddings among the planar immersions of the disk.

Citation

Download Citation

Mohammad Ghomi. "Affine unfoldings of convex polyhedra." Geom. Topol. 18 (5) 3055 - 3090, 2014. https://doi.org/10.2140/gt.2014.18.3055

Information

Received: 2 September 2013; Revised: 16 January 2014; Accepted: 16 April 2014; Published: 2014
First available in Project Euclid: 20 December 2017

zbMATH: 1327.52013
MathSciNet: MR3285229
Digital Object Identifier: 10.2140/gt.2014.18.3055

Subjects:
Primary: 52B05 , 57N35
Secondary: 05C10 , 57M10

Keywords: convex polyhedron , covering spaces , development , Dürer's problem , edge graph , immersion , isometric embedding‎ , spanning tree , Unfolding

Rights: Copyright © 2014 Mathematical Sciences Publishers

Vol.18 • No. 5 • 2014
MSP
Back to Top