On Convex Developments of a Doubly-Covered Square

  • Jin Akiyama
  • Koichi Hirata
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3330)


We give an algebraic characterization of all convex polygons that are 2-flat foldable to a square, that is, we determine all shapes of convex developments of a doubly-covered square.


Equivalence Class Line Segment Lattice Point Commutative Diagram Convex Polygon 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Akiyama, J.: Beauty of Mathematics Woven by Intelligence: Live Broadcasting of Theorem Making Ventures, Chuo Shinsho (May 2004)Google Scholar
  2. 2.
    Akiyama, J., Hirata, K., Ruiz, M., Urrutia, J.: Flat 2-foldings of convex polygons. In: Indonesia-Japan Conference in Discrete and Computational Geometry 2003. LNCS. Springer, Heidelberg (2004)Google Scholar
  3. 3.
    Demaine, E., Demaine, M., Lubiw, A., O’Rourke, J.: Examples, counter-examples and enumeration results for foldings and unfoldings between polygons and polytopes, Smith Tech. Rep. 069 (July 2000)Google Scholar
  4. 4.
    Demaine, E., Demaine, M., Lubiw, A., O’Rourke, J.: Enumerating foldings between polygons and polytopes. Graphs and Combinatorics 18(1), 93–104 (2002)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Jin Akiyama
    • 1
  • Koichi Hirata
    • 2
  1. 1.Research Institute of Educational DevelopmentTokai UniversityTokyoJapan
  2. 2.Faculty of EducationEhime UniversityMatsuyamaJapan

Personalised recommendations