Flat 2-foldings of convex polygons

3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A folding of a simple polygon into a convex polyhedron is accomplished by glueing portions of the perimeter of the polygon together to form a polyhedron. A polygon Q is a flat n-folding of a polygon P if P can be folded to exactly cover the surface of Q n times, with no part of the surface of P left over. In this paper we focus on a specific type of flat 2-foldings, flat 2-foldings that wrap Q; that is, foldings of P that cover both sides of Q exactly once. We determine, for any n, all the possible flat 2-foldings of a regular n-gon. We finish our paper studying the set of polygons that are flat 2-foldable to regular polygons. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Akiyama, J., Hirata, K., Ruiz, M. J. P., & Urrutia, J. (2005). Flat 2-foldings of convex polygons. In Lecture Notes in Computer Science (Vol. 3330, pp. 14–24). Springer Verlag. https://doi.org/10.1007/978-3-540-30540-8_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free