Unfolding Restricted Convex Caps
| dc.creator | O'Rourke, Joseph | |
| dc.date | 2007-09-11 | |
| dc.date.accessioned | 2026-07-07T08:28:47Z | |
| dc.date.available | 2026-07-07T08:28:47Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0709.1647 | |
| dc.identifier | http://arxiv.org/abs/0709.1647 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/137743 | |
| dc.subject | Computational Geometry | |
| dc.subject | F.2.2 | |
| dc.title | Unfolding Restricted Convex Caps | |
| dc.type | text |