Related papers: Rigid Origami Vertices: Conditions and Forcing Set…
Using a mathematical model for self-foldability of rigid origami, we determine which monohedral quadrilateral tilings of the plane are uniquely self-foldable. In particular, the Miura-ori and Chicken Wire patterns are not self-foldable…
Motivated by constraint-based CAD software, we develop the foundation for the rigidity theory of a very general model: the body-and-cad structure, composed of rigid bodies in 3D constrained by pairwise coincidence, angular and distance…
We examine the conditions under which a signed graph contains an edge or a vertex that is contained in a unique negative circle or a unique positive circle. For an edge in a unique signed circle, the positive and negative case require the…
This paper introduces the notion of weak rigidity to characterize a framework by pairwise inner products of inter-agent displacements. Compared to distance-based rigidity, weak rigidity requires fewer constrained edges in the graph to…
We consider the problem of finding an inductive construction, based on vertex splitting, of triangulated spheres with a fixed number of additional edges (braces). We show that for any positive integer $b$ there is such an inductive…
Single-mode deformations of two-dimensional materials, such as the Miura-ori zig-zag fold, are important to the design of deployable structures because of their robustness; these usually require careful pre-patterning of the material. Here…
For plane frameworks with reflection or rotational symmetries, where the group action is not necessarily free on the vertex set, we introduce a phase-symmetric orbit rigidity matrix for each irreducible representation of the group. We then…
We survey more recent attempts at enumerating the number of mountain-valley assignments that allow a given crease pattern to locally fold flat. In particular, we solve this problem for square twist tessellations and generalize the method…
We develop a combinatorial model of paperfolding for the purposes of enumeration. A planar embedding of a graph is called a {\em crease pattern} if it represents the crease lines needed to fold a piece of paper into something. A {\em flat…
Origami folded cylinders (origami bellows) have found increasingly sophisticated applications in space flight and medicine. In spite of this interest, a general understanding of the mechanics of an origami folded cylinder has been elusive.…
The article studies the elastic and locomotive properties of Miura-ori-type paper origami. The mechanics of a single paper crease is studied experimentally, and its non-elastic properties turn out to be crucial. The entire origami…
This article extends the range of 1-DOF rigid-foldable developable quadrilateral creased papers. In a previous article, we put forward a sufficient and necessary condition for a quadrilateral creased paper to be rigid-foldable, and…
We study methods to obtain the consistency of forcing axioms, and particularly higher forcing axioms. We first force over a model with a supercompact cardinal $\theta>\kappa$ to get the consistency of the forcing axiom for $\kappa$-strongly…
Kirigami, the creative art of paper cutting, is a promising paradigm for mechanical metamaterials. However, to make kirigami-inspired structures a reality requires controlling the topology of kirigami to achieve connectivity and rigidity.…
This work considers the distance constrained formation control problem with an additional constraint requiring that the formation exhibits a specified spatial symmetry. We employ recent results from the theory of symmetry-forced rigidity to…
Manipulation of thin sheets by folding and cutting offers opportunity to engineer structures with novel mechanical properties, and to prescribe complex force-displacement relationships via material elasticity in combination with the…
This is an overview about a method of constructing ccc forcings: Suppose first that a continuous, commutative system of complete embeddings between countable forcings indexed along $\omega_1$ is given. Then its direct limit satisfies ccc by…
A graph is called (generically) rigid in R^d if, for any choice of sufficiently generic edge lengths, it can be embedded in R^d in a finite number of distinct ways, modulo rigid transformations. Here, we deal with the problem of determining…
We study geometrical clues of a rigidity transition due to the emergence of a system-spanning state of self stress in under-constrained systems of individual polygons and spring networks constructed from such polygons. When a polygon with…
We investigate families of graphs and graphons (graph limits) that are defined by a finite number of prescribed subgraph densities. Our main focus is the case when the family contains only one element, i.e., a unique structure is forced by…