中文
相关论文

相关论文: Flattening single-vertex origami: the non-expansiv…

200 篇论文

We study the problem of deciding whether a crease pattern can be folded by simple folds (folding along one line at a time) under the infinite all-layers model introduced by [Akitaya et al., 2017], in which each simple fold is defined by an…

计算几何 · 计算机科学 2019-01-25 Hugo A. Akitaya , Cordelia Avery , Joseph Bergeron , Erik D. Demaine , Justin Kopinsky , Jason Ku

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…

软凝聚态物质 · 物理学 2024-09-30 Matthew Grasinger , Andrew Gillman , Philip Buskohl

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…

组合数学 · 数学 2019-10-04 Alvin Chiu , William Hoganson , Thomas C. Hull , Sylvia Wu

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

度量几何 · 数学 2020-04-09 Zeyuan He , Simon D. Guest

Origami is an ancient art that continues to yield both artistic and scientific insights to this day. In 2012, Buhler, Butler, de Launey, and Graham extended these ideas even further by developing a mathematical construction inspired by…

环与代数 · 数学 2023-06-07 Deveena R. Banerjee , Sara Chari , Adriana Salerno

Traditional origami structures can be continuously deformed back to a flat sheet of paper, while traditional kirigami requires glue or seams in order to maintain its rigidity. In the former, non-trivial geometry can be created through…

材料科学 · 物理学 2020-01-29 Xinyu Wang , Simon D. Guest , Randall D. Kamien

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…

计算复杂性 · 计算机科学 2024-06-25 Michael Assis

We combine large-scale atomistic modelling with continuum elastic theory to study the shapes of graphene sheets embedding nanoscale kirigami. Lattice segments are selectively removed from a flat graphene sheet and the structure is allowed…

介观与纳米尺度物理 · 物理学 2015-11-06 Bastien F. Grosso , E. J. Mele

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…

计算几何 · 计算机科学 2022-01-04 Tetsuo Ida , Hidekazu Takahashi

Traditional origami starts from flat surfaces, leading to crease patterns consisting of Euclidean vertices. However, Euclidean vertices are limited in their folding motions, are degenerate, and suffer from misfolding. Here we show how…

软凝聚态物质 · 物理学 2020-09-30 Scott Waitukaitis , Peter Dieleman , Martin van Hecke

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…

数学物理 · 物理学 2018-09-12 Michael Assis

Origami is the art of paper folding, and it borrows its name from two Japanese words \emph{ori} and \emph{kami}. In Japanese, {ori} means folding, and the paper is called {kami}. While origami is just a hobby to most, there is a lot more to…

历史与综述 · 数学 2025-03-18 Archana S. Morye

Non-Euclidean origami is a promising technique for designing multistable deployable structures folded from nonplanar developable surfaces. The impossibility of flat foldability inherent to non-Euclidean origami results in two disconnected…

软凝聚态物质 · 物理学 2023-07-20 Clark Addis , Salvador Rojas , Andres F. Arrieta

In this paper, we show that deciding rigid foldability of a given crease pattern using all creases is weakly NP-hard by a reduction from Partition, and that deciding rigid foldability with optional creases is strongly NP-hard by a reduction…

计算几何 · 计算机科学 2020-11-10 Hugo Akitaya , Erik D. Demaine , Takashi Horiyama , Thomas C. Hull , Jason S. Ku , Tomohiro Tachi

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…

软凝聚态物质 · 物理学 2022-03-25 M. E. Lee-Trimble , Ji-Hwan Kang , Ryan C. Hayward , Christian D. Santangelo

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…

计算几何 · 计算机科学 2017-05-30 David Dureisseix

The geometric, aesthetic, and mathematical elegance of origami is being recognized as a powerful pathway to self-assembly of micro and nano-scale machines with programmable mechanical properties. The typical approach to designing the…

Fold-and-cut theorem claims the possibility to cut out from a sheet a set of straight-line drawing using only one cut of scissors, without producing any other cut in the sheet and separating all the figures at the same time, just by folding…

历史与综述 · 数学 2020-04-21 M. L. Spreafico , E. Tramuns

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

环与代数 · 数学 2025-07-11 Sara Chari , Andrew Quinn Macauley

Kirigami involves cutting a flat, thin sheet that allows it to morph from a closed, compact configuration into an open deployed structure via coordinated rotations of the internal tiles. By recognizing and generalizing the geometric…

软凝聚态物质 · 物理学 2021-10-15 Gary P. T. Choi , Levi H. Dudte , L. Mahadevan