When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. 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.

  3. Fold-and-cut theorem - Wikipedia

    en.wikipedia.org/wiki/Fold-and-cut_theorem

    The corresponding problem that the theorem solves is known as the fold-and-cut problem, which asks what shapes can be obtained by the so-called fold-and-cut method. A particular instance of the problem, which asks how a particular shape can be obtained by the fold-and-cut method, is known as a fold-and-cut problem.

  4. 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 ...

  5. Huzita–Hatori axioms - Wikipedia

    en.wikipedia.org/wiki/Huzita–Hatori_axioms

    The Huzita–Justin axioms or Huzita–Hatori axioms are a set of rules related to the mathematical principles of origami, describing the operations that can be made when folding a piece of paper. The axioms assume that the operations are completed on a plane (i.e. a perfect piece of paper), and that all folds are linear.

  6. 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).

  7. 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 ...

  8. Origamics - Wikipedia

    en.wikipedia.org/wiki/Origamics

    Origamics: Mathematical Explorations Through Paper Folding is a book on the mathematics of paper folding by Kazuo Haga [], a Japanese retired biology professor.It was edited and translated into English by Josefina C. Fonacier and Masami Isoda, based on material published in several Japanese-language books by Haga, and published in 2008 by World Scientific. [1]

  9. Kawasaki's theorem - Wikipedia

    en.wikipedia.org/wiki/Kawasaki's_theorem

    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 rest of the paper flat and only changing the dihedral angles at each fold. For rigid origami (a type of folding that keeps the surface flat except at its folds, suitable ...