Related papers: Minimal forcing sets for 1D origami
Origami structures have been widely explored in robotics due to their many potential advantages. Origami robots can be very compact, as well as cheap and efficient to produce. In particular, they can be constructed in a flat format using…
Rigid origami is examined from the perspective of rigidity theory. First and second order rigidity are defined from local differential analysis of the consistency constraint; while the static rigidity and prestress stability are defined…
In this paper, we study (zero) forcing sets which induce connected subgraphs of a graph. The minimum cardinality of such a set is called the connected forcing number of the graph. We provide sharp upper and lower bounds on the connected…
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…
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…
In this paper, we will show methods to interpret some rigid origami with higher degree vertices as the limit case of structures with degree-4 supplementary angle vertices. The interpretation is based on separating each crease into two…
It has been known since 1996 that deciding whether a collection of creases on a piece of paper can be fully folded flat without causing self-intersection or adding new creases is an NP-Hard problem (Bern and Hayes). In their proof, a binary…
One-dimensional slender bodies can be deformed or shaped into spatially complex curves relatively easily due to their inherent compliance. However, traditional methods of fabricating complex spatial shapes are cumbersome, prone to error…
Traditional origami structures can be continuously deformed back to a flat sheet of paper, while traditional kirigami requires glue or seams in order to maintain its rigidity. In the former, non-trivial geometry can be created through…
Here we describe an ultra-low-cost origami-based approach for large-scale manufacturing of microscopes, specifically demonstrating brightfield, darkfield, and fluorescence microscopes. Merging principles of optical design with origami…
Power domination in graphs arises from the problem of monitoring an electric power system by placing as few measurement devices in the system as possible. A power dominating set of a graph is a set of vertices that observes every vertex in…
Inspired by the allure of additive fabrication, we pose the problem of origami design from a new perspective: how can we grow a folded surface in three dimensions from a seed so that it is guaranteed to be isometric to the plane? We solve…
For centuries, human civilizations devised metal forming techniques to make tools and items; yet, customized metal forming remains costly and intricate. Laser-forming origami} (lasergami) is a metal forming process where a laser beam cuts…
Origami is an ancient art that continues to yield both artistic and scientific insights to this day. In 2012, Buhler, Butler, de Launey, and Graham extended these ideas even further by developing a mathematical construction inspired by…
We develop a theoretical framework for rigid origami, and show how this framework can be used to connect rigid origami and results from cognate areas, such as the rigidity theory, graph theory, linkage folding and computer science. First,…
Zero forcing is an iterative graph coloring process whereby a colored vertex with a single uncolored neighbor forces that neighbor to be colored. It is NP-hard to find a minimum zero forcing set - a smallest set of initially colored…
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…
For a graph $G$ in which vertices are either black or white, a zero forcing process is an iterative vertex color changing process such that the only white neighbor of a black vertex becomes black in the next time step. A zero forcing set is…
Kirigami involves cutting a flat, thin sheet that allows it to morph from a closed, compact configuration into an open deployed structure via coordinated rotations of the internal tiles. By recognizing and generalizing the geometric…
A dominating set $D_{f}\subseteq V(G)$ of vertices in a graph $G$ is called a \emph{dom-forcing set} if the sub-graph induced by $\langle D_{f} \rangle$ must form a zero forcing set. The minimum cardinality of such a set is known as the…