Sciweavers

Share
CORR
2007
Springer

Unfolding Restricted Convex Caps

12 years 1 months ago
Unfolding Restricted Convex Caps
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.
Joseph O'Rourke
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2007
Where CORR
Authors Joseph O'Rourke
Comments (0)
books