Related papers: Minimum Forcing Sets for Miura Folding Patterns
Let G be a graph with a perfect matching. A complete forcing set of G is a subset of edges of G to which the restriction of every perfect matching is a forcing set of it. The complete forcing number of G is the minimum cardinality of…
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…
Modeling folding surfaces with nonzero thickness is of practical interest for mechanical engineering. There are many existing approaches that account for material thickness in folding applications. We propose a new systematic and broadly…
The forcing number of a perfect matching $M$ in a graph $G$ is the smallest number of edges inside $M$ that can not be contained in other perfect matchings. The anti-forcing number of $M$ is the smallest number of edges outside $M$ whose…
Kirigami is an increasingly useful fabrication method to produce shape-programmable metamaterial structures. However, inverse design remains difficult because deployment is nonlinear, and feasible cut layouts must satisfy discrete…
An algorithm is proposed for constructing directed spanning forests of the minimum weight, in which the maximum possible degree of affinity between the minimum forests is preserved when the number of trees changes. The correctness of the…
A graph in which all minimal zero forcing sets are in fact minimum size is called ``well-forced." This paper characterizes well-forced trees and presents an algorithm for determining which trees are well-forced. Additionally, we…
Rigid origami has shown potential in large diversity of practical applications. However, current rigid origami crease pattern design mostly relies on known tessellations. This strongly limits the diversity and novelty of patterns that can…
We consider the zero-energy deformations of periodic origami sheets with generic crease patterns. Using a mapping from the linear folding motions of such sheets to force-bearing modes in conjunction with the Maxwell-Calladine index theorem…
Origami structures have been proposed as a means of creating three-dimensional structures from the micro- to the macroscale, and as a means of fabricating mechanical metamaterials. The design of such structures requires a deep understanding…
It is well known that the set of origami constructible numbers is larger than the classical straight-edge and compass constructible numbers. However, the Huzita-Justin-Hatori origami constructible numbers remain algebraic so that the…
We study the problem of deciding whether a crease pattern can be folded by simple folds (folding along one line at a time) under the infinite all-layers model introduced by [Akitaya et al., 2017], in which each simple fold is defined by an…
Origami inspired architectures offer a powerful route toward lightweight, reconfigurable, and programmable robotic systems. Yet, a unified mechanics framework capable of seamlessly bridging rigid folding, elastic deformation, and stability…
Symmetric submodular function minimization admits purely combinatorial algorithms using special orderings of the ground set. Extending the minimum-cut algorithm of Nagamochi and Ibaraki (1992), Queyranne (1998) showed that the maximum…
Kirigami, the Japanese art of paper cutting, has recently enabled the design of stretchable mechanical metamaterials that can be easily realized by embedding arrays of periodic cuts into an elastic sheet. Here, we exploit kirigami…
In this paper, we study minimal (with respect to inclusion) zero forcing sets. We first investigate when a graph can have polynomially or exponentially many distinct minimal zero forcing sets. We also study the maximum size of a minimal…
We develop recursion equations to describe the three-dimensional shape of a sheet upon which a series of concentric curved folds have been inscribed. In the case of no stretching outside the fold, the three-dimensional shape of a single…
Origami, the ancient art of folding thin sheets, has attracted increasing attention for its practical value in diverse fields: architectural design, therapeutics, deployable space structures, medical stent design, antenna design and…
Zero forcing is a binary coloring game on a graph where a set of filled vertices can force non-filled vertices to become filled following a color change rule. In 2008, the zero forcing number of a graph was shown to be an upper bound on its…
A global forcing set for maximal matchings of a graph $G=(V(G), E(G))$ is a set $S \subseteq E(G)$ such that $M_1\cap S \neq M_2 \cap S$ for each pair of maximal matchings $M_1$ and $M_2$ of $G$. The smallest such set is called a minimum…