Unfolding Polyhedra via Cut-Tree Truncation

We prove that an infinite class of convex polyhedra, produced by restricted vertex truncations, always unfold without overlap. The class includes the “domes,” providing a simpler proof that these unfold without overlap.

• Type: Conference
• Year: 2007
• Where: CCCG
• Authors: Alex Benton, Joseph O'Rourke
• Keywords: CCCG 2007, Computational Geometry, Convex Polyhedra, Restricted Vertex Truncations