2000 character limit reached
Affine unfoldings of convex polyhedra (1305.3231v2)
Published 14 May 2013 in math.MG, math.CO, and math.GT
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 Durer's unfoldability problem, which answers a question of Croft, Falconer, and Guy. Among other techniques, the proof employs a topological characterization for embeddings among the planar immersions of the disk.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.