![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile
In the classical model of tile self-assembly, unit square tiles translate in the plane and attach edgewise to form large crystalline structures. This model of self-assembly has been shown to be capable of asympto...
-
Chapter and Conference Paper
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
When can a plane graph with prescribed edge lengths and prescribed angles (from among {0,180°, 360°}) be folded flat to lie in an infinitesimally thick line, without crossings? This problem generalizes the cla...
-
Chapter and Conference Paper
Dissection with the Fewest Pieces is Hard, Even to Approximate
We prove that it is NP-hard to dissect one simple orthogonal polygon into another using a given number of pieces, as is approximating the fewest pieces to within a factor of
-
Chapter and Conference Paper
Continuous Flattening of Orthogonal Polyhedra
Can we flatten the surface of any 3-dimensional polyhedron P without cutting or stretching? Such continuous flat folding motions are known when P is convex, but the question remains open for nonconvex polyhedra. ...
-
Chapter and Conference Paper
Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron
We present two universal hinge patterns that enable a strip of material to fold into any connected surface made up of unit squares on the 3D cube grid—for example, the surface of any polycube. The folding is e...