Vertex unfoldings of tight polyhedra

2011/08/31 by Toshiki Endo, Endo, Toshiki, Yuki Suzuki +1
Computer Science · Mathematics · #Combinatorics (math.CO) #Computational Geometry (cs.CG) #FOS: Computer and information sciences #FOS: Mathematics #cs.CG #math.CO

paper · pdf · doi:10.48550/arxiv.1109.0001

8 pages, 5 figures

arxiv created 2013/02/18 · arxiv updated 2013/02/19

Abstract

An unfolding of a polyhedron along its edges is called a vertex unfolding if adjacent faces are allowed to be connected at not only an edge but also a vertex. Demaine et al showed that every triangulated polyhedron has a vertex unfolding. We extend this result to a tight polyhedron, where a polyhedron is tight if all non-triangular faces are mutually non-adjacent parallelograms.

Related

• Ununfoldable Polyhedra with Convex Faces
• Existence of a polyhedron which does not have a non-overlapping pseudo-edge unfolding
• Grid Vertex-Unfolding Orthogonal Polyhedra
• Unfolding Polyhedra
• Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra