Unfolding Restricted Convex Caps

Details Unfolding Restricted Convex Caps Unfolding Restricted Convex Caps

2007-09-11

arxiv.org/abs/0709.1647v1

Computer Science

Computational Geometry

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Unfolding Restricted Convex Caps does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Unfolding Restricted Convex Caps, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unfolding Restricted Convex Caps will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-392674