English
Related papers

Related papers: An Efficient Enumeration of Flat-Foldings : Study …

200 papers

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…

Discrete Mathematics · Computer Science 2017-03-21 Mirela Damian , Erik Demaine , Muriel Dulieu , Robin Flatland , Hella Hoffman , Thomas C. Hull , Jayson Lynch , Suneeta Ramaswami

We map the problem of determining flat-foldability of the origami diagram onto the ground-state search problem of spin glass model on random graphs. If the origami diagram is locally flat-foldable around each vertex, a pre-folded diagram,…

Disordered Systems and Neural Networks · Physics 2025-04-01 Chihiro Nakajima

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

This article is concerned with an example of complex planar geometry arising from flat origami challenges. The complexity of solution algorithms is illustrated, depending on the depth of the initial analysis of the problem, starting from…

Computational Geometry · Computer Science 2017-05-30 David Dureisseix

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

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

We introduce the study of forcing sets in mathematical origami. The origami material folds flat along straight line segments called creases, each of which is assigned a folding direction of mountain or valley. A subset $F$ of creases is…

Data Structures and Algorithms · Computer Science 2017-03-21 Brad Ballinger , Mirela Damian , David Eppstein , Robin Flatland , Jessica Ginepro , Thomas Hull

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

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

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

Origami describes rules for creating folded structures from patterns on a flat sheet, but does not prescribe how patterns can be designed to fit target shapes. Here, starting from the simplest periodic origami pattern that yields one…

Soft Condensed Matter · Physics 2018-12-24 Levi H. Dudte , Etienne Vouga , Tomohiro Tachi , L. Mahadevan

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

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…

Probability · Mathematics 2025-02-07 Thomas C. Hull , Marcus Michelen , Corrine Yap

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…

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

Origami, the traditional paper-folding art, has inspired the modern design of numerous flexible structures in science and engineering. In particular, origami structures with different physical properties have been studied and utilized for…

Soft Condensed Matter · Physics 2025-07-24 Rongxuan Li , Gary P. T. Choi

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…

Graphics · Computer Science 2026-04-06 Yanjia Huang , Yunuo Chen , Ying Jiang , Jinru Han , Zhengzhong Tu , Yin Yang , Chenfanfu Jiang

Folding paper along curves leads to spatial structures that have curved surfaces meeting at spatial creases, defined as curve-fold origami. In this work, we provide an Eulerian framework focusing on the mechanics of arbitrary curve-fold…

Soft Condensed Matter · Physics 2024-08-16 Zhixuan Wen , Pengyu Lv , Fan Feng , Huiling Duan

We introduce a computational origami problem which we call the segment folding problem: given a set of $n$ line-segments in the plane the aim is to make creases along all segments in the minimum number of folding steps. Note that a folding…

Computational Geometry · Computer Science 2022-01-17 Takashi Horiyama , Fabian Klute , Matias Korman , Irene Parada , Ryuhei Uehara , Katsuhisa Yamanaka

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…

Soft Condensed Matter · Physics 2024-09-30 Matthew Grasinger , Andrew Gillman , Philip Buskohl
‹ Prev 1 2 3 10 Next ›