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 Qn 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 wrapQ ; 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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Demaine, E., Demaine, M., Lubiw, A., O’Rourke, J.: Enumerating foldings between polygons and polytopes. Graphs and Combinatorics 18(1), 93–104 (2002)
Akiyama, J., Nakamura, G.: Foldings of regular polygons to convex polyhedra I: Equilateral triangles. In: Proc. IJCCGT. LNCS. Springer, Heidelberg (2004) (to appear)
Akiyama, J., Nakamura, G.: Foldings of regular polygons to convex polyhedra II: Regular pentagons. J. Indonesia Math. Soc. 9, 89–99 (2003)
Akiyama, J., Nakamura, G.: Foldings of regular polygons to convex polyhedra III: Regular hexagons and regular n-gons, n ≥ 7 (to appear in Thai J. Math.)
Alexander, R., Dyson, H., O’Rourke, J.: The foldings of a square to convex polyhedra. In: Akiyama, J., Kano, M. (eds.) JCDCG 2002. LNCS, vol. 2866, pp. 38–50. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Akiyama, J., Hirata, K., Ruiz, MJ.P., Urrutia, J. (2005). Flat 2-Foldings of Convex Polygons. In: Akiyama, J., Baskoro, E.T., Kano, M. (eds) Combinatorial Geometry and Graph Theory. IJCCGGT 2003. Lecture Notes in Computer Science, vol 3330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30540-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-30540-8_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24401-1
Online ISBN: 978-3-540-30540-8
eBook Packages: Computer ScienceComputer Science (R0)