Related papers: A Parameterized Algorithm for Flat Folding
We develop an intrinsic necessary and sufficient condition for single-vertex origami crease patterns to be able to fold rigidly. We classify such patterns in the case where the creases are pre-assigned to be mountains and valleys as well as…
Rigid foldability allows an origami pattern to fold about crease lines without twisting or stretching component panels. It enables folding of rigid materials, facilitating the design of foldable structures. Recent study shows that rigid…
Fixed parameter tractable (FPT) algorithms run in time f(p(x)) poly(|x|), where f is an arbitrary function of some parameter p of the input x and poly is some polynomial function. Treewidth, branchwidth, cliquewidth, NLC-width, rankwidth,…
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…
Consider an oriented curve $\Gamma$ in a domain $D$ in the plane $\boldsymbol R^2$. Thinking of $D$ as a piece of paper, one can make a curved folding in the Euclidean space $\boldsymbol R^3$. This can be expressed as the image of an…
We present a fixed-parameter tractable algorithm for first-order model checking on interpretations of graph classes with bounded local cliquewidth. Notably, this includes interpretations of planar graphs, and more generally, of classes of…
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…
We give a fixed-parameter tractable algorithm that, given a parameter $k$ and two graphs $G_1,G_2$, either concludes that one of these graphs has treewidth at least $k$, or determines whether $G_1$ and $G_2$ are isomorphic. The running time…
We consider several quadrilateral origami tilings, including the Miura-ori crease pattern, allowing for crease-reversal defects above the ground state which maintain local flat-foldability. Using exactly solvable models, we show that these…
A single-vertex origami is a piece of paper with straight-line rays called creases emanating from a fold vertex placed in its interior or on its boundary. The Single-Vertex Origami Flattening problem asks whether it is always possible to…
The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for…
Origami and kirigami have emerged as potential tools for the design of mechanical metamaterials whose properties such as curvature, Poisson ratio, and existence of metastable states can be tuned using purely geometric criteria. A major…
We study the parameterized complexity of the classical Edge Hamiltonian Path problem and give several fixed-parameter tractability results. First, we settle an open question of Demaine et al. by showing that Edge Hamiltonian Path is FPT…
This paper addresses the problem of finding minimum forcing sets in origami. The origami material folds flat along straight lines called creases that can be labeled as mountains or valleys. A forcing set is a subset of creases that force…
Origami structures are characterized by a network of folds and vertices joining unbendable plates. For applications to mechanical design and self-folding structures, it is essential to understand the interplay between the set of folds in…
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…
Given a flat-foldable origami crease pattern $G=(V,E)$ (a straight-line drawing of a planar graph on a region of the plane) with a mountain-valley (MV) assignment $\mu:E\to\{-1,1\}$ indicating which creases in $E$ bend convexly (mountain)…
We investigate the tractability of a simple fusion of two fundamental structures on graphs, a spanning tree and a perfect matching. Specifically, we consider the following problem: given an edge-weighted graph, find a minimum-weight…
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 of Courcelle's celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic is fixed-parameter tractable on C by linear time parameterised algorithms. An immediate…