2009
DOI: 10.21236/ada524705
|View full text |Cite
|
Sign up to set email alerts
|

A Universal Crease Pattern for Folding Orthogonal Shapes

Abstract: We present a universal crease pattern-known in geometry as the tetrakis tiling and in origami as box pleating-that can fold into any object made up of unit cubes joined face-to-face (polycubes). More precisely, there is one universal finite crease pattern for each number n of unit cubes that need to be folded. This result contrasts previous universality results for origami, which require a different crease pattern for each target object, and confirms intuition in the origami community that box pleating is a po… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
30
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
5
3
1

Relationship

2
7

Authors

Journals

citations
Cited by 30 publications
(30 citation statements)
references
References 3 publications
0
30
0
Order By: Relevance
“…1), which has square subunits composed of eight isosceles triangles. Motivated by programmable matter, we recently proved that an n × n box-pleat tiling has as a folded state any polyhedral surface made up of OðnÞ unit cubes on the cubic lattice (18). Another theorem guarantees that any such folded state can be reached by a continuous folding motion without the material penetrating itself (19).…”
Section: Theoretical Backgroundmentioning
confidence: 99%
See 1 more Smart Citation
“…1), which has square subunits composed of eight isosceles triangles. Motivated by programmable matter, we recently proved that an n × n box-pleat tiling has as a folded state any polyhedral surface made up of OðnÞ unit cubes on the cubic lattice (18). Another theorem guarantees that any such folded state can be reached by a continuous folding motion without the material penetrating itself (19).…”
Section: Theoretical Backgroundmentioning
confidence: 99%
“…The planning process consists of four distinct algorithms: the input to the process is one or more folded states of a common box-pleat grid, which can be computed by the universality algorithm of ref. 18 or designed by human origamists. The output is a design of a programmable matter sheet and controllers for folding that sheet into any of the input shapes.…”
Section: Processmentioning
confidence: 99%
“…Moreover, some origami crease patterns have a property of universality [4], [5], [13]. This means that with a large enough sheet of paper, or small enough features, any 3-D structure can be sculpted.…”
Section: Origami-inspired Robotsmentioning
confidence: 99%
“…In mathematics, this grid is called the tetrakis tiling. The n×n box-pleat pattern was recently shown to be universal in that crease patterns formed by subsets of the hinges fold into all possible orthogonal shapes made out of O(n) cubes [BDDO09]. Therefore, exponentially many shapes can be made from different subsets of one common hinge pattern, forcing this collection of foldings to share many creases.…”
Section: Introductionmentioning
confidence: 99%