The Fold-and-Cut Theorem

There is an old magician's trick: fold a square of paper a few times, make one straight snip with the scissors, unfold — and out drops a perfect five-pointed star. Harry Houdini described it; Betsy Ross supposedly used it to pitch a five-pointed flag star.

The natural question is greedy. A star is easy enough — but could you do the same for any shape drawn with straight edges? A swan outline, your initials, the entire alphabet at once, a jagged silhouette of a city skyline? Fold the sheet flat the right way, make a single straight cut, and have exactly that shape fall out?

It sounds like it should fail for anything complicated. Astonishingly, it never does. Any shape whose boundary is made of straight line segments can be folded flat so that one straight cut releases it. The catch is hidden entirely in the folding — and finding those folds is where the real work lives.

Here is a sheet of paper with a shape outlined on it. The whole point of the fold-and-cut theorem is that you can collapse the paper flat so that every edge of the outline lands on one single straight line — and then one cut along that line frees the shape.

<p class="hint">{{hint}}</p>
<div class="shapes">
  <button class="pick on" data-shape="triangle" type="button">{{btn_triangle}}</button>
  <button class="pick" data-shape="star" type="button">{{btn_star}}</button>
  <button class="pick" data-shape="house" type="button">{{btn_house}}</button>
</div>
<canvas id="paper" width="380" height="300"></canvas>
<div class="status" id="status">{{status_initial}}</div>
<div class="btns">
  <button id="fold" type="button">{{btn_fold}}</button>
  <button id="cut" type="button" disabled>{{btn_cut}}</button>
  <button id="unfold" type="button" disabled>{{btn_unfold}}</button>
  <button id="reset" type="button" class="ghost">{{btn_reset}}</button>
</div>

* { box-sizing: border-box; }
body { font-family: system-ui, sans-serif; color: #222; margin: 0; }
.hint { font-size: .9rem; color: #444; margin: 0 0 .6rem; line-height: 1.45; }
.shapes { display: flex; gap: .4rem; margin: 0 0 .5rem; }
.pick { font: 600 13px system-ui, sans-serif; padding: .35rem .7rem; border: 1px solid #adb1b8;
        background: #fff; color: #1d3557; border-radius: 7px; cursor: pointer; }
.pick.on { background: #1d3557; color: #fff; border-color: #1d3557; }
canvas { background: #fbf7ee; border: 1px solid #d8cdb5; border-radius: 8px; display: block; touch-action: none; }
.status { font-size: 1rem; font-weight: 600; margin: .55rem 0; min-height: 1.4em; }
.status.ok { color: #0a7d33; }
.btns { display: flex; gap: .5rem; flex-wrap: wrap; }
button { font: 600 14px system-ui, sans-serif; padding: .45rem .9rem; border: 1px solid #1d3557;
         background: #1d3557; color: #fff; border-radius: 8px; cursor: pointer; }
button:disabled { opacity: .4; cursor: default; }
button.ghost { background: #fff; color: #1d3557; }

// Code not found

Pick a shape and press Fold flat: watch the outline collapse until all its edges stack onto the dashed cut line. Then press Cut to make the single straight snip and Unfold to reveal the shape falling out. The hard part was never the cutting — it was figuring out the fold pattern (the crease pattern) that brings every edge onto the same line at once.

So how hard is it, really — and is it always possible?

• It is always possible, and it is proven. In 1999 Erik Demaine, Martin Demaine and Anna Lubiw published the fold-and-cut theorem: any plane figure bounded by straight line segments — a single polygon, many polygons, even shapes nested inside one another or sharing points — can be folded flat so that one complete straight cut produces exactly that figure. This is a solved theorem, not a conjecture.
• The idea behind the folds. To make one cut work, every edge of the outline must be brought onto a single line. The crease pattern that does this is built from the straight skeleton of the shape (roughly, the lines traced by the shrinking outline) plus extra "perpendicular" creases. Folding along those creases reflects every edge onto the cut line.
• Two known methods. The straight-skeleton method (Demaine–Demaine–Lubiw) and an earlier disk-packing method (Bern, Demaine, Eppstein, Hayes) both give provably correct crease patterns; both run in time polynomial in the number of edges.
• The flat-foldability subtlety. Deciding whether an arbitrary given crease pattern folds flat without the paper passing through itself is a separate, much harder question — that general flat-folding problem is NP-hard. The fold-and-cut crease patterns are special and always foldable, but the broader landscape touches genuinely intractable territory.

The punchline: the answer to "can one cut do it?" is a clean yes, always, but it sits next to questions — like general flat foldability and tiling-style folding — that are as hard as anything in P vs NP.

"Make a flat sheet become a precise 3-D thing" is a surprisingly valuable shape for a problem to have, and fold-and-cut is the playful entry point to the whole field of computational origami:

• Deployable structures: solar arrays and space-telescope mirrors fold compactly for launch, then unfold to full size — the math of valid flat folds is exactly this family.
• Self-folding materials: sheets printed with crease patterns that fold themselves when heated or wet, used in soft robotics and microfabrication.
• Medical devices: stents and implants that travel folded through a vessel and expand at the target.
• Airbags and packaging: engineers simulate how a folded sheet unfolds without tearing or jamming — a direct relative of flat-foldability.

Understand why one cut always suffices and you have met computational origami — the same crease-pattern reasoning behind deployable engineering and the harder, sometimes intractable folding problems that live just beyond it.

The fold-and-cut theorem is one of those rare results that sounds like a tall tale and turns out to be exactly true: hand someone any shape with straight edges, and there is always a way to fold the paper flat so a single straight cut frees it perfectly. Demaine, Demaine and Lubiw nailed it down in 1999, and the straight skeleton tells you how.

The magic was never in the scissors — it was in the folding. And that is the recurring lesson of computational geometry: the easy-looking final move hides all the structure, and just past the tidy "always yes" of fold-and-cut sit the genuinely hard folding problems that brush up against P vs NP.