Corpus ID: 5476660

Unfolding Restricted Convex Caps

@article{ORourke2007UnfoldingRC,
  title={Unfolding Restricted Convex Caps},
  author={J. O'Rourke},
  journal={ArXiv},
  year={2007},
  volume={abs/0709.1647}
}
  • J. O'Rourke
  • Published 2007
  • Computer Science, Mathematics
  • ArXiv
  • 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. 
    1 Citations

    Figures and Topics from this paper.

    References

    SHOWING 1-4 OF 4 REFERENCES
    On the development of the intersection of a plane with a polytope
    • 16
    • PDF
    An Extension of Cauchy's Arm Lemma with Application to Curve Development
    • 8
    Geometric Folding Algorithms: Linkages
    • 135