pith. sign in

arxiv: cs/0107024 · v1 · submitted 2001-07-18 · 💻 cs.CG · cs.DM

Enumerating Foldings and Unfoldings between Polygons and Polytopes

classification 💻 cs.CG cs.DM
keywords polytopesmanypolygonpolygonsquestionsanalogousansweranswers
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.