Related papers: Minimal forcing sets for 1D origami
An origami extrusion is a folding of a 3D object in the middle of a flat piece of paper, using 3D gadgets which create faces with solid angles. Our main concern is to make origami extrusions of polyhedrons using 3D gadgets with simple…
Origami is the archetype of a structural material with unusual mechanical properties that arise almost exclusively from the geometry of its constituent folds and forms the basis for mechanical metamaterials with an extreme deformation…
Twisting sheets as a strategy to form functional yarns relies on millennia of human practice in making catguts and fabric wearables, but still lacks overarching principles to guide their intricate architectures. We show that twisted…
We study the minimum rank of a (simple, undirected) graph, which is the minimum rank among all matrices in a space determined by the graph. We determine the exact set of graphs on eight vertices for which the nullity of a minimum rank…
Designing a robot or structure that can fold itself into a target shape is a process that involves challenges originated from multiple sources. For example, the designer of rigid self-folding robots must consider foldability from geometric…
We explore the surprisingly rich energy landscape of origami-like folding planar structures. We show that the configuration space of rigid-paneled degree-4 vertices, the simplest building blocks of such systems, consists of at least two…
Fold-and-cut theorem claims the possibility to cut out from a sheet a set of straight-line drawing using only one cut of scissors, without producing any other cut in the sheet and separating all the figures at the same time, just by folding…
The dramatic effect kirigami, such as hole cutting, has on the elastic properties of thin sheets invites a study of the mechanics of thin elastic frames under an external load. Such frames can be thought of as modular elements needed to…
Three-dimensional shells can be synthesized from the spontaneous self-folding of two-dimensional templates of interconnected panels, called nets. However, some nets are more likely to self-fold into the desired shell under random movements.…
We study, experimentally and theoretically, the mechanical response of sheet materials on which line cracks or cuts are arranged in a simple pattern. Such sheet materials, often called kirigami (the Japanese words, kiri and gami, stand for…
Twisted hypercubes are graphs that generalize the structure of the hypercube by relaxing the symmetry constraint while maintaining degree-regularity and connectivity. We study the zero forcing number of twisted hypercubes. Zero forcing is a…
For a digraph $G$, a set $F\subseteq V(G)$ is said to be a feedback vertex set (FVS) if $G-F$ is acyclic. The problem of finding a smallest FVS is NP-hard. We present a matrix scaling technique for finding feedback vertex sets in…
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…
We characterize the cut patterns that can be produced by "orthogonal fold & cut": folding an axis-aligned rectangular sheet of paper along horizontal and vertical creases, and then making a single straight cut (at any angle). Along the way,…
In 2018, forts were defined as non-empty subsets of vertices in a graph where no vertex outside the set has exactly one neighbor in the set. Forts have since been used to characterize zero forcing sets, model zero forcing as an integer…
This study explores the use of origami composite structures as active aerodynamic control surfaces. Towards this goal, two origami concepts were designed leveraging a combination of analytical and finite element modeling, and computational…
The positive zero forcing number of a graph is a graph parameter that arises from a non-traditional type of graph colouring, and is related to a more conventional version of zero forcing. We establish a relation between the zero forcing and…
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum-weight triangulation (MWT) problem, we are looking for a triangulation of a given point set that minimizes the sum of the edge…
A connected forcing set of a graph is a zero forcing set that induces a connected subgraph. In this paper, we introduce and study CF-dense graphs -- graphs in which every vertex belongs to some minimum connected forcing set. We identify…
Zero forcing is a propagation process on a graph, or digraph, defined in linear algebra to provide a bound for the minimum rank problem. Independently, zero forcing was introduced in physics, computer science and network science, areas…