enow.com Web Search

Search results

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

    en.wikipedia.org/wiki/Map_folding

    The map folding and stamp folding problems are related to a problem in the mathematics of origami of whether a square with a crease pattern can be folded to a flat figure. If a folding direction (either a mountain fold or a valley fold ) is assigned to each crease of a strip of stamps, it is possible to test whether the result can be folded ...

  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. Geometric Folding Algorithms - Wikipedia

    en.wikipedia.org/wiki/Geometric_Folding_Algorithms

    It includes the NP-completeness of testing flat foldability, [2] the problem of map folding (determining whether a pattern of mountain and valley folds forming a square grid can be folded flat), [2] [4] the work of Robert J. Lang using tree structures and circle packing to automate the design of origami folding patterns, [2] [4] the fold-and ...

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

  6. Napkin folding problem - Wikipedia

    en.wikipedia.org/wiki/Napkin_folding_problem

    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 to Vladimir Arnold and the folding of a Russian ruble bank note. It is the first problem listed by Arnold in his book Arnold's Problems, where he calls it the rumpled dollar problem ...

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

  8. Big-little-big lemma - Wikipedia

    en.wikipedia.org/wiki/Big-little-big_lemma

    In the mathematics of paper folding, the big-little-big lemma is a necessary condition for a crease pattern with specified mountain folds and valley folds to be able to be folded flat. [1] It differs from Kawasaki's theorem, which characterizes the flat-foldable crease patterns in which a mountain-valley assignment has not yet been made.

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