Folding Polyominoes from One Level to Two
Greg N. Frederickson
Abstract
Greg N. Frederickson
Abstract
SummaryFor any given polyomino, is it possible to cut it into pieces and then hinge the pieces, so that the polyomino folds up into a similar version of itself but two levels thick? While we don't know how to do this for every polyomino, the article does show how to cut, hinge, and fold polyominoes from several infinite classes, providing an inexhaustible supply of puzzles that are both fun to solve and beautiful to fold.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
SummaryFor any given polyomino, is it possible to cut it into pieces and then hinge the pieces, so that the polyomino folds up into a similar version of itself but two levels thick? While we don't know how to do this for every polyomino, the article does show how to cut, hinge, and fold polyominoes from several infinite classes, providing an inexhaustible supply of puzzles that are both fun to solve and beautiful to fold.
Key concepts: Polyomino, Mathematics, Combinatorics, Hinge, Folding (DSP implementation), Discrete mathematics, Geometry, Regular polygon