Unfolding Polyhedra Via Cut-Tree Truncation

Authors

Alex Benton, University of Cambridge
Joseph O'Rourke, Smith CollegeFollow

Document Type

Conference Proceeding

Publication Date

12-1-2007

Publication Title

CCCG 2007 - 19th Canadian Conference on Computational Geometry

Abstract

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.

First Page

77

Last Page

80

Rights

© the authors

Comments

Archived as published.

Recommended Citation

Benton, Alex and O'Rourke, Joseph, "Unfolding Polyhedra Via Cut-Tree Truncation" (2007). Computer Science: Faculty Publications, Smith College, Northampton, MA.
https://scholarworks.smith.edu/csc_facpubs/194