CCCG 2007 - 19th Canadian Conference on Computational Geometry
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.
© the authors
Benton, Alex and O'Rourke, Joseph, "Unfolding Polyhedra Via Cut-Tree Truncation" (2007). Computer Science: Faculty Publications, Smith College, Northampton, MA.