English
Related papers

Related papers: Realization and Connectivity of the Graphs of Orig…

200 papers

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…

Computational Geometry · Computer Science 2026-01-21 David Eppstein

A foundational result in origami mathematics is Kawasaki and Justin's simple, efficient characterization of flat foldability for unassigned single-vertex crease patterns (where each crease can fold mountain or valley) on flat material. This…

Computational Geometry · Computer Science 2022-04-11 Lily Chung , Erik D. Demaine , Dylan Hendrickson , Victor Luo

Flat-foldability problem of origami is the problem to determine whether a given crease pattern drawn on a piece of paper is possible to fold without any penetration or intrusion of a polygon into any connections among them. It is known from…

Disordered Systems and Neural Networks · Physics 2025-06-17 Chihiro Nakajima

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…

Combinatorics · Mathematics 2024-05-15 Thomas C. Hull , Manuel Morales , Sarah Nash , Natalya Ter-Saakov

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…

Metric Geometry · Mathematics 2025-07-22 Thomas C. Hull

In this paper, we study how to fold a specified origami crease pattern in order to minimize the impact of paper thickness. Specifically, origami designs are often expressed by a mountain-valley pattern (plane graph of creases with relative…

Data Structures and Algorithms · Computer Science 2016-03-22 Erik D. Demaine , David Eppstein , Adam Hesterberg , Hiro Ito , Anna Lubiw , Ryuhei Uehara , Yushi Uno

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…

Soft Condensed Matter · Physics 2018-03-01 Bryan Gin-ge Chen , Christian D. Santangelo

"Flat origami" refers to the folding of flat, zero-curvature paper such that the finished object lies in a plane. Mathematically, flat origami consists of a continuous, piecewise isometric map $f:P\subseteq\mathbb{R}^2\to\mathbb{R}^2$ along…

Combinatorics · Mathematics 2025-02-27 Thomas C. Hull , Inna Zakharevich

When can a plane graph with prescribed edge lengths and prescribed angles (from among $\{0,180^\circ, 360^\circ$\}) be folded flat to lie in an infinitesimally thin line, without crossings? This problem generalizes the classic theory of…

Computational Geometry · Computer Science 2018-03-20 Zachary Abel , Erik D. Demaine , Martin L. Demaine , David Eppstein , Anna Lubiw , Ryuhei Uehara

Origami, where two-dimensional sheets are folded into complex structures, is proving to be rich with combinatorial and geometric structure, most of which remains to be fully understood. In this paper we consider \emph{flat origami}, where…

Combinatorics · Mathematics 2019-10-04 Alvin Chiu , William Hoganson , Thomas C. Hull , Sylvia Wu

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…

Metric Geometry · Mathematics 2013-07-04 Thomas C. Hull

We prove that testing the flat foldability of an origami crease pattern (either labeled with mountain and valley folds, or unlabeled) is fixed-parameter tractable when parameterized by the ply of the flat-folded state and by the treewidth…

Computational Geometry · Computer Science 2023-06-22 David Eppstein

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…

Differential Geometry · Mathematics 2020-09-11 Atsufumi Honda , Kosuke Naokawa , Kentaro Saji , Masaaki Umehara , Kotaro Yamada

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…

Computational Geometry · Computer Science 2010-03-19 Gaiane Panina , Ileana Streinu

Rigid origami, with applications ranging from nano-robots to unfolding solar sails in space, describes when a material is folded along straight crease line segments while keeping the regions between the creases planar. Prior work has found…

Metric Geometry · Mathematics 2022-04-27 Johnna Farnham , Thomas C. Hull , Aubrey Rumbolt

Rigidly and flat-foldable quadrilateral mesh origami is the class of quadrilateral mesh crease patterns with one fundamental property: the patterns can be folded from flat to fully-folded flat by a continuous one-parameter family of…

Soft Condensed Matter · Physics 2020-07-15 Fan Feng , Xiangxin Dang , Richard D. James , Paul Plucinsky

We explore the following problem: given a collection of creases on a piece of paper, each assigned a folding direction of mountain or valley, is there a flat folding by a sequence of simple folds? There are several models of simple folds;…

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…

Metric Geometry · Mathematics 2017-09-12 Thomas C. Hull , Tomohiro Tachi

Folding a sheet of paper along a curve can lead to structures seen in decorative art and utilitarian packing boxes. Here we present a theory for the simplest such structure: an annular circular strip that is folded along a central circular…

Soft Condensed Matter · Physics 2012-09-18 Marcelo A. Dias , Levi H. Dudte , L. Mahadevan , Christian D. Santangelo

We prove that every connected graph with $s$ vertices of degree not 2 has a spanning tree with at least ${1\over 4}(s-2)+2$ leaves. Let $G$ be a be a connected graph of girth $g$ with $v>1$ vertices. Let maximal chain of successively…

Combinatorics · Mathematics 2014-05-29 Anton Bankevich , Dmitri Karpov
‹ Prev 1 2 3 10 Next ›