2007/09/11 by Joseph O’Rourke, O'Rourke, Joseph
Engineering · #Advanced Materials and Mechanics #Computational Geometry (cs.CG) #Dynamics and Control of Mechanical Systems #F.2.2 #FOS: Computer and information sciences #Structural Analysis and Optimization
paper · pdf · doi:10.48550/arxiv.0709.1647
openalex publication_date 2007/09/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper details an algorithm for unfolding a class of convex polyhedra, where each polyhedron in the class consists of a convex cap over a rectangular base, with several restrictions: the cap's faces are quadrilaterals, with vertices over an underlying integer lattice, and such that the cap convexity is ``radially monotone,'' a type of smoothness constraint. Extensions of Cauchy's arm lemma are used in the proof of non-overlap.