Unfolding Restricted Convex Caps
Computational Geometry
2007-09-12 v1
Abstract
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.
Cite
@article{arxiv.0709.1647,
title = {Unfolding Restricted Convex Caps},
author = {Joseph O'Rourke},
journal= {arXiv preprint arXiv:0709.1647},
year = {2007}
}