27 February 2002. Thanks to L.
Association for the Advancement of Science,
Boston, February 2002
up folds to fight stubborn paper.
No road journey is complete without a wrestle with the map. Now a US computer scientist has worked out why the map usually wins.
Erik Demaine of the Massachusetts Institute of Technology in Cambridge has come up with an origami algorithm that predicts when a stubborn street plan will be re-foldable. "It's the meeting of paper folding and computer science," he says.
The rules governing whether a sheet of paper divided into a grid of folds can be pleated back into a packet will confirm many motorists' hunches.
Aligning mountain folds, protruding out of the sheet, and valley folds, poking inwards, is the key, Demaine told the meeting of the American Association for the Advancement of Science in Boston. "If they match up it's guaranteed to work," he said. "If they don't, you're toast."
Crumpling the map into the glove box won't help. A single 45o fold in the sheet, and the problem foxes even a computer, Demaine found. The models are probably little help to the harassed motorist, he admits.
Paper does not always follow predictions, warns mathematician Martin Kruskal of Rutgers University in New Jersey. Unlike a computer model, real paper has thickness - an A4 sheet is nearly impossible to fold in half more than six times. "Idealization has limitations," he says.
Computational origami is attacking other seemingly intractable paper-folding challenges. The gift-wrapping problem - the smallest square of paper that can cover a regular object - challenges many at Christmas. Comfortingly, it has only been solved for wrapping a simple cube.
Such algorithms can also predict whether a three-dimensional object can be unfolded into a flat sheet. The sheet-metal industry uses the program in reverse to build furniture or cars from a single sheet. Computational origami also creates new designs for the Japanese art.
� Nature News Service / Macmillan Magazines Ltd 2002