![]() ![]() This result was derived by Britney Gallivan, a high schooler from California, in December 2001. The distances L and t must be expressed in the same units, such as inches. In 2002, Belcastro and Hull brought to the theoretical origami the language of affine transformations, with an extension from R, where L is the minimum length of the paper (or other material), t is the material's thickness, and n is the number of folds possible. In late 2001 and early 2002, Britney Gallivan proved the minimum length of paper necessary to fold it in half a certain number of times and folded a 4,000-foot-long (1,200 m) piece of toilet paper twelve times. In 1999, a theorem due to Haga provided constructions used to divide the side of a square into rational fractions. In 1996, Marshall Bern and Barry Hayes showed to be an NP-complete problem the assignation of a crease pattern of mountain and valley folds in order to produce a flat origami structure starting from a flat sheet of paper.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |