English
Related papers

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

200 papers

Origami metamaterials made of repeating unit cells of parallelogram panels joined at folds dramatically change their shape through a collective motion of their cells. Here we develop an effective elastic model and numerical method to study…

Soft Condensed Matter · Physics 2025-06-02 Hu Xu , Frederic Marazzato , Paul Plucinsky

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…

History and Overview · Mathematics 2020-04-21 M. L. Spreafico , E. Tramuns

Thick origami structures are considered here as assemblies of polygonal panels hinged to each other along their edges according to a corresponding origami crease pattern. The determination of the internal actions caused by external loads in…

Soft Condensed Matter · Physics 2024-05-21 Andrea Micheletti , Alessandro Tiero , Giuseppe Tomassetti

A characterization of real numbers constructible by paper folding.

History and Overview · Mathematics 2007-09-21 Antonio M. Oller

Let $S_{g}$ denote the closed orientable surface of genus $g$. In joint work with Huang, the first author constructed exponentially-many (in $g$) mapping class group orbits of pairs of simple closed curves whose complement is a single…

Geometric Topology · Mathematics 2022-06-22 Tarik Aougab , William Menasco , Mark Nieland

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…

Mathematical Physics · Physics 2018-09-12 Michael Assis

Origami-based design holds promise for developing materials whose mechanical properties are tuned by crease patterns introduced to thin sheets. Although there has been heuristic developments in constructing patterns with desirable…

Soft Condensed Matter · Physics 2015-08-05 Arthur A. Evans , Jesse L. Silverberg , Christian D. Santangelo

We establish efficient approximate counting algorithms for several natural problems in local lemma regimes. In particular, we consider the probability of intersection of events and the dimension of intersection of subspaces. Our approach is…

Data Structures and Algorithms · Computer Science 2025-12-12 Ryan L. Mann , Gabriel Waite

We develop recursion equations to describe the three-dimensional shape of a sheet upon which a series of concentric curved folds have been inscribed. In the case of no stretching outside the fold, the three-dimensional shape of a single…

Soft Condensed Matter · Physics 2012-12-17 Marcelo A. Dias , Christian D. Santangelo

Rigid origami is a branch of origami with great potential in engineering applications to deal with rigid-panel folding. One of the challenges is to compactly fold the polyhedra made from rigid facets with a single degree of freedom. In this…

Applied Physics · Physics 2020-05-15 Yuanqing Gu , Yan Chen

Periodic origami patterns made with repeating unit cells of creases and panels bend and twist in complex ways. In principle, such soft modes of deformation admit a simplified asymptotic description in the limit of a large number of cells.…

Soft Condensed Matter · Physics 2025-01-03 Hu Xu , Ian Tobasco , Paul Plucinsky

We explore the surprisingly rich energy landscape of origami-like folding planar structures. We show that the configuration space of rigid-paneled degree-4 vertices, the simplest building blocks of such systems, consists of at least two…

Soft Condensed Matter · Physics 2017-09-26 Scott Waitukaitis , Rémi Menaut , Bryan Gin-ge Chen , Martin van Hecke

We use a regular arrangement of kirigami elements to demonstrate an inverse design paradigm for folding a flat surface into complex target configurations. We first present a scheme using arrays of disclination defect pairs on the dual to…

Soft Condensed Matter · Physics 2016-02-17 Daniel M. Sussman , Yigil Cho , Toen Castle , Xingting Gong , Euiyeon Jung , Shu Yang , Randall D. Kamien

An efficient algorithm to enumerate the vertices of a two-dimensional (2D) projection of a polytope, is presented in this paper. The proposed algorithm uses the support function of the polytope to be projected and enumerated for vertices.…

Computational Geometry · Computer Science 2016-12-01 Amit Gurung , Rajarshi Ray

Two-dimensional (2D) origami tessellations such as the Miura-ori are often generalized to build three-dimensional (3D) architected materials with sandwich or cellular structures. However, such 3D blocks are densely packed with continuity of…

Soft Condensed Matter · Physics 2025-07-02 Guowei Wayne Tu , Evgueni T. Filipov

The emergence of massive graph data sets requires fast mining algorithms. Centrality measures to identify important vertices belong to the most popular analysis methods in graph mining. A measure that is gaining attention is forest…

Data Structures and Algorithms · Computer Science 2021-01-18 Alexander van der Grinten , Eugenio Angriman , Maria Predari , Henning Meyerhenke

This work harnesses interpretable machine learning methods to address the challenging inverse design problem of origami-inspired systems. We show that a decision tree-random forest method is particularly suitable for fitting origami…

Soft Condensed Matter · Physics 2022-11-15 Yi Zhu , Evgueni T. Filipov

We investigate numerically efficient approximations of eigenspaces associated to symmetric and general matrices. The eigenspaces are factored into a fixed number of fundamental components that can be efficiently manipulated (we consider…

Machine Learning · Computer Science 2021-09-29 Cristian Rusu , Lorenzo Rosasco

Origami metamaterials typically consist of folded sheets with periodic patterns, conferring them with remarkable mechanical properties. In the context of Continuum Mechanics, the majority of existing predictive methods are mechanism analogs…

Soft Condensed Matter · Physics 2026-01-22 Xuwen Li , Amin Jamalimehr , Mathias Legrand , Damiano Pasini

We show that deciding whether a given set of circles can be packed into a rectangle, an equilateral triangle, or a unit square are NP-hard problems, settling the complexity of these natural packing problems. On the positive side, we show…

Computational Geometry · Computer Science 2010-09-21 Erik D. Demaine , Sandor P. Fekete , Robert J. Lang