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

  4. Map (higher-order function) - Wikipedia

    en.wikipedia.org/wiki/Map_(higher-order_function)

    Map functions can be and often are defined in terms of a fold such as foldr, which means one can do a map-fold fusion: foldr f z . map g is equivalent to foldr (f . g) z. The implementation of map above on singly linked lists is not tail-recursive, so it may build up a lot of frames on the stack when called with a large list. Many languages ...

  5. Mathematics of paper folding - Wikipedia

    en.wikipedia.org/wiki/Mathematics_of_paper_folding

    For example, the Miura map fold is a rigid fold that has been used to deploy large solar panel arrays for space satellites. The napkin folding problem is the problem of whether a square or rectangle of paper can be folded so the perimeter of the flat figure is greater than that of the original square.

  6. Fold (higher-order function) - Wikipedia

    en.wikipedia.org/wiki/Fold_(higher-order_function)

    Folds can be regarded as consistently replacing the structural components of a data structure with functions and values. Lists, for example, are built up in many functional languages from two primitives: any list is either an empty list, commonly called nil ([]), or is constructed by prefixing an element in front of another list, creating what is called a cons node ( Cons(X1,Cons(X2,Cons ...

  7. Miura fold - Wikipedia

    en.wikipedia.org/wiki/Miura_fold

    The Miura fold (ミウラ折り, Miura-ori) is a method of folding a flat surface such as a sheet of paper into a smaller area. The fold is named for its inventor, Japanese astrophysicist Kōryō Miura. [1] The crease patterns of the Miura fold form a tessellation of the surface by parallelograms.

  8. Kawasaki's theorem - Wikipedia

    en.wikipedia.org/wiki/Kawasaki's_theorem

    Kawasaki's theorem, applied to each of the vertices of an arbitrary crease pattern, determines whether the crease pattern is locally flat-foldable, meaning that the part of the crease pattern near the vertex can be flat-folded.

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

  1. Related searches map folding techniques in python language examples pdf printable sheet spanish

    maths of folding paperpaper folding geometry