enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Map folding - Wikipedia

    en.wikipedia.org/wiki/Map_folding

    In the stamp folding problem, the paper is a strip of stamps with creases between them, and the folds must lie on the creases. In the map folding problem, the paper is a map, divided by creases into rectangles, and the folds must again lie only along these creases. Lucas (1891) credits the invention of the stamp folding problem to Émile ...

  3. Mathematics of paper folding - Wikipedia

    en.wikipedia.org/wiki/Mathematics_of_paper_folding

    The fold-and-cut problem asks what shapes can be obtained by folding a piece of paper flat, and making a single straight complete cut. The solution, known as the fold-and-cut theorem, states that any shape with straight sides can be obtained. A practical problem is how to fold a map so that it may be manipulated with minimal effort or movements.

  4. Tom Hull (mathematician) - Wikipedia

    en.wikipedia.org/wiki/Tom_Hull_(mathematician)

    Hull is the author or co-author of several books on origami, including: Origametry: Mathematical Methods in Paper Folding (Cambridge University Press, 2021) [8]; Project Origami: Activities for Exploring Mathematics (AK Peters, 2006; 2nd ed., CRC Press, 2013) [9]

  5. Kawasaki's theorem - Wikipedia

    en.wikipedia.org/wiki/Kawasaki's_theorem

    Although Kawasaki's theorem completely describes the folding patterns that have flat-folded states, it does not describe the folding process needed to reach that state. For some (multi-vertex) folding patterns, it is necessary to curve or bend the paper while transforming it from a flat sheet to its flat-folded state, rather than keeping the ...

  6. Maekawa's theorem - Wikipedia

    en.wikipedia.org/wiki/Maekawa's_theorem

    Maekawa's theorem is a theorem in the mathematics of paper folding named after Jun Maekawa. It relates to flat-foldable origami crease patterns and states that at every vertex, the numbers of valley and mountain folds always differ by two in either direction. [1] The same result was also discovered by Jacques Justin [2] and, even earlier, by S ...

  7. Geometric Folding Algorithms - Wikipedia

    en.wikipedia.org/wiki/Geometric_Folding_Algorithms

    Geometric Folding Algorithms: Linkages, Origami, Polyhedra is a monograph on the mathematics and computational geometry of mechanical linkages, paper folding, and polyhedral nets, by Erik Demaine and Joseph O'Rourke. It was published in 2007 by Cambridge University Press (ISBN 978-0-521-85757-4).

  8. Napkin folding problem - Wikipedia

    en.wikipedia.org/wiki/Napkin_folding_problem

    The napkin folding problem is a problem in geometry and the mathematics of paper folding that explores whether folding a square or a rectangular napkin can increase its perimeter. The problem is known under several names, including the Margulis napkin problem , suggesting it is due to Grigory Margulis , and the Arnold's rouble problem referring ...

  9. Miura fold - Wikipedia

    en.wikipedia.org/wiki/Miura_fold

    The Miura fold is a form of rigid origami, meaning that the fold can be carried out by a continuous motion in which, at each step, each parallelogram is completely flat. This property allows it to be used to fold surfaces made of rigid materials, making it distinct from the Kresling fold and Yoshimura fold which cannot be rigidly folded and ...