Enumerating Foldings and Unfoldings between Polygons and Polytopes

Details Enumerating Foldings and Unfoldings between Polygons and Polytopes Enumerating Foldings and Unfoldings between Polygons and Polytopes

2001-07-18

arxiv.org/abs/cs/0107024v1

Graphs and Combinatorics 18(1) 93-104 (2002)

Computer Science

Computational Geometry

12 pages; 10 figures; 10 references. Revision of version in Proceedings of the Japan Conference on Discrete and Computational

Scientific paper

We pose and answer several questions concerning the number of ways to fold a
polygon to a polytope, and how many polytopes can be obtained from one polygon;
and the analogous questions for unfolding polytopes to polygons. Our answers
are, roughly: exponentially many, or nondenumerably infinite.

Affiliated with

Also associated with

No associations

Rating

Enumerating Foldings and Unfoldings between Polygons and Polytopes 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 Enumerating Foldings and Unfoldings between Polygons and Polytopes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumerating Foldings and Unfoldings between Polygons and Polytopes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-581285