Related papers: Minimal forcing sets for 1D origami
We survey results on the foldability of flat origami models. The main topics are the question of when a given crease pattern can fold flat, the combinatorics of mountain and valley creases, and counting how many ways a given crease pattern…
An "origami" (or flat structure) on a closed oriented surface, $S_g$, of genus $g \geq 2$ is obtained from a finite collection of unit Euclidean squares by gluing each right edge to a left one and each top edge to a bottom one. The main…
Rigid origami is a branch of origami with great potential in engineering applications to deal with rigid-panel folding. One of the challenges is to compactly fold the polyhedra made from rigid facets with a single degree of freedom. In this…
This article reviews the so-called "axioms" of origami (paper folding), which are elementary single-fold operations to achieve incidences between points and lines in a sheet of paper. The geometry of reflections is applied, and exhaustive…
We develop a theory of random flat-foldable origami. Given a crease pattern, we consider a uniformly random assignment of mountain and valley creases, conditioned on the assignment being flat-foldable at each vertex. A natural method to…
The zero forcing process is an iterative graph colouring process in which at each time step a coloured vertex with a single uncoloured neighbour can force this neighbour to become coloured. A zero forcing set of a graph is an initial set of…
Let $S_g$ denoting the genus $g$ closed orientable surface. An {\em origami} (or flat structure) on $S_g$ is obtained from a finite collection of unit Euclidean squares by gluing each right edge to a left one and each top edge to a bottom…
Flat origami studies straight line, planar graphs $C=(V,E)$ drawn on a region $R\subset\mathbb{R}^2$ that can act as crease patterns to map, or fold, $R$ into $\mathbb{R}^2$ in a way that is continuous and a piecewise isometry exactly on…
For origami structures, perforating or cutting slits along creases is an effective method to define fold lines and alleviate stress concentrations at vertices. In this letter we show numerically and experimentally that for…
We prove several hardness results on folding origami crease patterns. Flat-folding finite crease patterns is fixed-parameter tractable in the ply of the folded pattern (how many layers overlap at any point) and the treewidth of an…
This paper shows a cut along a crease on an origami sheet makes simple modeling of popular traditional basic folds such as a squash fold in computational origami. The cut operation can be applied to other classical folds and significantly…
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…
The ability to transform a flat sheet into a complex three-dimensional structure is a fundamental test of physical intelligence. Unlike cloth manipulation, origami is governed by strict geometric axioms and hard kinematic constraints, where…
The field of rigid origami concerns the folding of stiff, inelastic plates of material along crease lines that act like hinges and form a straight-line planar graph, called the crease pattern of the origami. Crease pattern vertices in the…
Origami is the art of folding paper into various patterns without cutting or tearing the paper. By viewing the paper as the complex plane, we iteratively compute and record all intersection points to construct mathematical origami sets.…
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…
The use of origami in engineering has significantly expanded in recent years, spanning deployable structures across scales, folding robotics, and mechanical metamaterials. However, finding foldable paths can be a formidable task as the…
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…
Self-folding origami, structures that are engineered flat to fold into targeted, three-dimensional shapes, have many potential engineering applications. Though significant effort in recent years has been devoted to designing fold patterns…
We investigate the graphs formed from the vertices and creases of an origami pattern that can be folded flat along all of its creases. As we show, this is possible for a tree if and only if the internal vertices of the tree all have even…