English
Related papers

Related papers: Face flips in origami tessellations

200 papers

Miura-ori is well-known for its capability of flatly folding a sheet of paper through a tessellated crease pattern made of repeating parallelograms. Many potential applications have been based on the Miura-ori and its primary variations.…

Metric Geometry · Mathematics 2020-04-09 Zeyuan He , Simon D. Guest

Continuing results from JCDCGGG 2016 and 2017, we solve several new cases of the simple foldability problem -- deciding which crease patterns can be folded flat by a sequence of (some model of) simple folds. We give new efficient algorithms…

Computational Geometry · Computer Science 2023-06-02 Hugo Akitaya , Josh Brunner , Erik D. Demaine , Dylan Hendrickson , Victor Luo , Andy Tockman

This paper proposes a family of origami tessellations called extruded Miura-Ori, whose folded state lies between two parallel planes with some faces on the planes, potentially useful for folded core materials because of face bonding. An…

Computational Geometry · Computer Science 2020-07-21 Kai Suto , Akito Adachi , Tomohiro Tachi , Yasushi Yamaguchi

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…

Soft Condensed Matter · Physics 2022-03-25 M. E. Lee-Trimble , Ji-Hwan Kang , Ryan C. Hayward , Christian D. Santangelo

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

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 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

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

Kirigami tessellations, regular planar patterns formed by cutting flat, thin sheets, have attracted recent scientific interest for their rich geometries, surprising material properties and promise for technologies. Here we pose and solve…

Soft Condensed Matter · Physics 2020-02-10 Gary P. T. Choi , Levi H. Dudte , L. Mahadevan

Origami folded cylinders (origami bellows) have found increasingly sophisticated applications in space flight and medicine. In spite of this interest, a general understanding of the mechanics of an origami folded cylinder has been elusive.…

Soft Condensed Matter · Physics 2017-01-18 Austin Reid , Frederic Lechenault , Sergio Rica , Mokhtar Adda-Bedia

Let G = (V, E) be a planar triangulated graph (PTG) having every face triangular. A rectilinear dual or an orthogonal floor plan (OFP) of G is obtained by partitioning a rectangle into \mid V \mid rectilinear regions (modules) where two…

Computational Geometry · Computer Science 2020-06-26 Pinki , Krishnendra Shekhawat

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…

Computational Geometry · Computer Science 2009-09-30 Nadia Benbernou , Erik D. Demaine , Martin L. Demaine , Aviv Ovadya

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

Origami crease patterns are folding paths that transform flat sheets into spatial objects. Origami patterns with a single degree of freedom (DOF) have creases that fold simultaneously. More often, several substeps are required to…

Computational Engineering, Finance, and Science · Computer Science 2020-06-11 Yucai Hu , Haiyi Liang

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

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

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 consider the zero-energy deformations of periodic origami sheets with generic crease patterns. Using a mapping from the linear folding motions of such sheets to force-bearing modes in conjunction with the Maxwell-Calladine index theorem…

Soft Condensed Matter · Physics 2020-12-24 James McInerney , Bryan Gin-ge Chen , Louis Theran , Christian Santangelo , Zeb Rocklin

A flip in a plane spanning tree $T$ is the operation of removing one edge from $T$ and adding another edge such that the resulting structure is again a plane spanning tree. For trees on a set of points in convex position we study two…

Computational Geometry · Computer Science 2025-08-22 Oswin Aichholzer , Joseph Dorfer , Birgit Vogtenhuber

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