Graphs and Combinatorics

, Volume 27, Issue 3, pp 377–397 | Cite as

(Non)Existence of Pleated Folds: How Paper Folds Between Creases

  • Erik D. Demaine
  • Martin L. Demaine
  • Vi Hart
  • Gregory N. Price
  • Tomohiro Tachi
Proceedings Paper

Abstract

We prove that the pleated hyperbolic paraboloid, a familiar origami model known since 1927, in fact cannot be folded with the standard crease pattern in the standard mathematical model of zero-thickness paper. In contrast, we show that the model can be folded with additional creases, suggesting that real paper “folds” into this model via small such creases. We conjecture that the circular version of this model, consisting simply of concentric circular creases, also folds without extra creases. At the heart of our results is a new structural theorem characterizing uncreased intrinsically flat surfaces—the portions of paper between the creases. Differential geometry has much to say about the local behavior of such surfaces when they are sufficiently smooth, e.g., that they are torsal ruled. But this classic result is simply false in the context of the whole surface. Our structural characterization tells the whole story, and even applies to surfaces with discontinuities in the second derivative. We use our theorem to prove fundamental properties about how paper folds, for example, that straight creases on the piece of paper must remain piecewise-straight (polygonal) by folding.

Keywords

Origami Hypar Hyperbolic paraboloid Folding Developable surface 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Adler, E.D.: A new unity! The art and pedagogy of Josef Albers. PhD thesis, University of Maryland (2004)Google Scholar
  2. 2.
    Alefeld G., Herzberger J.: Introduction to Interval Computations. Academic Press, New York (1983)MATHGoogle Scholar
  3. 3.
    Alexandrov, A.D.: Convex Polyhedra. Springer, New York (2005). Translation of Russian edition (1950)Google Scholar
  4. 4.
    Barequet G., Dickerson M., Eppstein D.: On triangulating three-dimensional polygons. Comput. Geometry: Theory Appl. 10(3), 155–170 (1998)CrossRefMATHMathSciNetGoogle Scholar
  5. 5.
    Chen L.-L., Woo T.C.: Computational geometry on the sphere with application to automated machining. J. Mech. Des. 114(2), 288–295 (1992)CrossRefGoogle Scholar
  6. 6.
    Demaine, E.D., Demaine, M.L.: History of curved origami sculpture. http://erikdemaine.org/curved/history/ (2008)
  7. 7.
    Demaine, E.D., Demaine, M.L., Lubiw, A.: Polyhedral sculptures with hyperbolic paraboloids. In: Proceedings of the 2nd Annual Conference of BRIDGES: Mathematical Connections in Art, Music, and Science (BRIDGES’99), pp. 91–100, Winfield, Kansas, July 30–August 1 1999Google Scholar
  8. 8.
    Donoso, M., O’Rourke, J.: Nonorthogonal polyhedra built from rectangles. arXiv:cs/0110059v2 [cs.CG], May 2002. http://www.arXiv.org/abs/cs.CG/011005.. In: Proceedings of the 14th Canadian Conference on Computational Geometry, Lethbridge, Canada, August 2002, pp. 101–104 (Abstract)
  9. 9.
    Demaine E.D., O’Rourke J.: Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Cambridge University Press, New York (2007)CrossRefMATHGoogle Scholar
  10. 10.
    Fuchs D., Tabachnikov S.: More on paperfolding. Am. Math. Mon. 106(1), 27–35 (1999)CrossRefMATHMathSciNetGoogle Scholar
  11. 11.
    Gauss, C.F.: General Investigations of Curved Surfaces. Princeton University Library, 1902. Translated by J.C. Morehead and A. M. Hiltebeitel from 1827 original. Republished by Dover (2005)Google Scholar
  12. 12.
    Halsted, G.B.: Elements of Geometry. Wiley (1885). http://books.google.com/books?id=HCdoFvAcHyIC
  13. 13.
    Hayes B.: A lucid interval. Am. Scientist 91(6), 484–488 (2003)Google Scholar
  14. 14.
    Huffman D.A.: Curvature and creases: a primer on paper. IEEE Trans. Comput. C25(10), 1010–1019 (1976)CrossRefGoogle Scholar
  15. 15.
    Hull, T.: The combinatorics of flat folds: a survey. In: Origami3: Proceedings of the 3rd International Meeting of Origami Science, Math, and Education, pp. 29–38, Monterey, California, March 2001Google Scholar
  16. 16.
    Justin, J.: Mathematics of origami, part 9. British Origami, pp. 28–30, June 1986Google Scholar
  17. 17.
    Koschitz, D., Demaine, E.D., Demaine, M.L.: Curved crease origami. In: Abstracts from Advances in Architectural Geometry (AAG 2008), pp. 29–32, Vienna, Austria, September 13–16, 2008Google Scholar
  18. 18.
    Kasahara K., Takahama T.: Origami for the Connoisseur. Japan Publications, Inc., Tokyo (1987)Google Scholar
  19. 19.
    Moore R.E., Baker Kearfott R., Cloud M.J.: Introduction to Interval Analysis. SIAM Press, Philadelphia (2009)CrossRefMATHGoogle Scholar
  20. 20.
    Belcastro S.-M., Hull T.C.: Modelling the folding of paper into three dimensions using affine transformations. Linear Algebra Appl. 348, 273–282 (2002)CrossRefMATHMathSciNetGoogle Scholar
  21. 21.
    Spivak, M.: A Comprehensive Introduction to Differential Geometry, 2nd edn. Publish or Perish (1979)Google Scholar
  22. 22.
    Streinu, I., Whiteley, W.: Single-vertex origami and spherical expansive motions. In: Revised Selected Papers from the Japan Conference on Discrete and Computational Geometry. Lecture Notes in Computer Science, vol. 3742, pp. 161–173, Tokyo, Japan, October 2004Google Scholar
  23. 23.
    Wertheim, M.: Origami as the shape of things to come. The New York Times, February 15, 2005. http://www.nytimes.com/2005/02/15/science/15origami.html
  24. 24.
    Wikipedia.: Trilateration. http://en.wikipedia.org/wiki/Trilateration (2008)
  25. 25.
    Wingler, H.M.: Bauhaus: Weimar, Dessau, Berlin, Chicago. MIT Press (1969)Google Scholar

Copyright information

© Springer 2011

Authors and Affiliations

  • Erik D. Demaine
    • 1
  • Martin L. Demaine
    • 1
  • Vi Hart
    • 2
  • Gregory N. Price
    • 1
  • Tomohiro Tachi
    • 3
  1. 1.MIT Computer Science and Artificial Intelligence LaboratoryCambridgeUSA
  2. 2.Stony BrookUSA
  3. 3.Graduate School of Arts and SciencesThe University of TokyoTokyoJapan

Personalised recommendations