Fold-and-cut theorem

From Wikipedia, the free encyclopedia
  (Redirected from Fold-and-cut problem)
Jump to: navigation, search

The fold-and-cut theorem states that any shape with straight sides can be cut from a single (idealized) sheet of paper by folding it flat and making a single straight complete cut.[1] Such shapes include polygons, which may be concave, shapes with holes, and collections of such shapes (i.e. the regions need not be connected).

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.

History[edit]

The earliest known description of a fold-and-cut problem appears in Wakoku Chiyekurabe (Mathematical Contests), a book that was published in 1721 by Kan Chu Sen in Japan.[2]

An 1873 article in Harper's New Monthly Magazine describes how Betsy Ross may have proposed that stars on the American flag have five points, because such a shape can easily be obtained by the fold-and-cut method.[3]

In the 20th century, several mathematicians published books containing examples of fold-and-cut problems, including Will Blyth,[4] Harry Houdini,[5] and Gerald Loe (1955).[6]

Inspired by Loe, Martin Gardner wrote about the fold-and-cut problems in Scientific American in 1960. Examples mentioned by Gardner include separating the red squares from the black squares of a checkerboard with one cut, and "an old paper-cutting stunt, of unknown origin" in which one cut splits a piece of paper into both a Latin cross and a set of smaller pieces that can be rearranged to spell the word "hell". Foreshadowing work on the general fold-and-cut theorem, he writes that "more complicated designs present formidable problems".[7]

The first proof of the fold-and-cut theorem, solving the problem, was published in 1999 by Erik Demaine, Martin Demaine, and Anna Lubiw.[8][9]

Solutions[edit]

There are two general methods known for solving instances of the fold-and-cut problem, based on straight skeletons and on circle packing respectively.

Straight skeleton[edit]

Disk packing[edit]

References[edit]

  1. ^ Demaine, Erik D.; Demaine, Martin L. (2004), "Fold-and-Cut Magic", Tribute to a Mathemagician, A K Peters, pp. 23–30 .
  2. ^ The Fold-and-Cut Problem: Kan Chu Sen's Wakoku Chiyekurabe, Erik Demaine, 2010, retrieved 2013-10-20.
  3. ^ Osgood, Kate Putnam (1873), "National standards and emblems", Harper's 47 (278): 171–181, "Mrs. Ross expressed her willingness to make the flag, but suggested that the stars would be more symmetrical and pleasing to the eye if made with five points, and she showed them how such a star could be made, by folding a sheet of paper and producing the pattern by a single cut." 
  4. ^ Blyth, Will (1920), Paper magic : being a collection of entertaining and amusing models, toys, puzzles, conjuring tricks, etc., in which paper is the only or principle material required, London: C. Arthur Pearson .
  5. ^ Houdini, Harry (1922), Houdini's paper magic; the whole art of performing with paper, including paper tearing, paper folding and paper puzzles, New York: E.P. Dutton & company .
  6. ^ Loe, Gerald M. (1955), Paper Capers, Chicago, Illinois: Magic .
  7. ^ Gardner, Martin (June 1960), "Paper cutting", Scientific American . Reprinted with additional material as Chapter 5 of Martin Gardner's New Mathematical Diversions from Scientific American, Simon & Schuster, 1966, pp. 58–69.
  8. ^ Demaine, Erik D.; Demaine, Martin L.; Lubiw, Anna (1999), "Folding and one straight cut suffice", Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '99), pp. 891–892 .
  9. ^ O'Rourke, Joseph (2013), How to Fold It, Cambridge University Press, p. 144, ISBN 9781139498548 .