Related papers: Computational Complexities of Folding
Rigid origami has shown potential in large diversity of practical applications. However, current rigid origami crease pattern design mostly relies on known tessellations. This strongly limits the diversity and novelty of patterns that can…
The ancient art of origami, traditionally used to transform simple sheets into intricate objects, also holds potential for diverse engineering applications, such as shape morphing and robotics. In this study, we demonstrate that one of the…
Origami has shown the potential to approximate three-dimensional curved surfaces by folding through designed crease patterns on flat materials. The Miura-ori tessellation is a widely used pattern in engineering and tiles the plane when…
An origami manifold is a manifold equipped with a closed 2-form which is symplectic except on a hypersurface where it is like the pullback of a symplectic form by a folding map and its kernel fibrates with oriented circle fibers over a…
We study the spontaneous folding of a 2D template of microscopic panels into a 3D pyramid, driven by thermal fluctuations. Combining numerical simulations and analytical calculations, we find that the total folding time is a non-monotonic…
We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…
In this paper, we investigate rigid-ruling folding motions of crease-rule patterns, that is, conjugacy-preserving isometries of developable semi-discrete conjugate nets. We derive two conditions for the rigid-ruling foldability of pairs of…
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…
The odd-red bipartite perfect matching problem asks to find a perfect matching containing an odd number of red edges in a given red-blue edge-colored bipartite graph. While this problem lies in $\mathsf{P}$, its polyhedral structure remains…
In this paper we consider developable surfaces which are isometric to planar domains and which are piecewise differentiable, exhibiting folds along curves. The paper revolves around the longstanding problem of existence of the so-called…
A notion of "radially monotone" cut paths is introduced as an effective choice for finding a non-overlapping edge-unfolding of a convex polyhedron. These paths have the property that the two sides of the cut avoid overlap locally as the cut…
We study the problem of folding a polyomino $P$ into a polycube $Q$, allowing faces of $Q$ to be covered multiple times. First, we define a variety of folding models according to whether the folds (a) must be along grid lines of $P$ or can…
We consider the task of learning Ising models when the signs of different random variables are flipped independently with possibly unequal, unknown probabilities. In this paper, we focus on the problem of robust estimation of…
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.…
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…
We investigate the computational complexity of edge-deletion and edge-contraction problems in fuzzy graphs. For any graph property {\Pi} that is hereditary under contractions (or deletions) and determined by 3-connected components, the…
We propose a novel computational framework for modeling and simulating origami structures. In this framework, bilinear solid-shell elements are employed to model the origami panels while crease folding is considered through the angle…
Optimal Morse matchings reveal essential structures of cell complexes which lead to powerful tools to study discrete geometrical objects, in particular discrete 3-manifolds. However, such matchings are known to be NP-hard to compute on…
Non-rigid origami patterns could provide more versatile performance than their rigid counterparts in the design of mechanical metamaterials owing to the simultaneous deformation of facets and creases, but their complex deformation modes…
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…