We prove that testing the flat foldability of an origami crease pattern (either labeled with
mountain and valley folds, or unlabeled) is fixed-parameter tractable when parameterized by …

We study the continuous motion of smooth isometric embeddings of a planar surface in three-
dimensional Euclidean space, and two related discrete analogues of these embeddings …

We consider the construction of a polygon P with n vertices whose turning angles at the
vertices are given by a sequence A=(α _0, ..., α _ n-1) A=(α 0,…, α n-1), α _i ∈ (-π, π) α i∈ …

We present a Java implementation of Lang's Universal Molecule algorithm, alongside with a
visualization of its interconnected structures: the input metric tree and compatible convex …

In a seminal paper from 1996 that marks the beginning of computational origami, R. Lang
introduced TreeMaker, a method for designing origami crease patterns with an underlying …

This paper presents a toolchain for the design and simulation of reconfigurable robots that
can be built from a single rigid sheet of smart material with embedded actuators and sensors …

In this dissertation we study problems related to polygonal skeleton structures that have
applications to computational origami. The two main structures studied are the straight …

The problem of computing the maximum reach configurations of a 3D revolute-jointed
manipulator is a long-standing open problem in robotics. In this paper we present an optimal …

Abstract Space structures are often designed to serve only a single objective during their
mission life; examples range from solar sails for propulsion over shields for protection to …

Our grant project “Combinatorial and Algorithmic Rigidity: Beyond Two Dimensions” was
submitted in 2008, under the DARPA solicitation “Mathematical Challenges, BAA 07-68”. It …