An official website of the United States government
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 explicit equations for the folding angles of a flat-foldable degree-4 origami vertex and some cases of degree-6 vertices. We extend this work to generalized symmetries of the degree-6 vertex where all sector angles equal 60 ∘ . We enumerate the different viable rigid folding modes of these degree-6 crease patterns and then use second-order Taylor expansions and prior rigid folding techniques to find algebraic folding angle relationships between the creases. This allows us to explicitly compute the configuration space of these degree-6 vertices, and in the process we uncover new explanations for the effectiveness of Weierstrass substitutions in modelling rigid origami. These results expand the toolbox of rigid origami mechanisms that engineers and materials scientists may use in origami-inspired designs.
more »
« less
Rigid foldability is NP-hard
In this paper, we show that the rigid-foldability of a given crease pattern using all creases is weakly NP-hard by a reduction from the partition problem, and that rigid-foldability with optional creases is NP-hard by a reduction from the 1-in-3 SAT problem. Unlike flat-foldabilty of origami or flexibility of other kinematic linkages, whose complexity originates in the complexity of the layer ordering and possible self-intersection of the material, rigid foldabilltiy from a planar state is hard even though there is no potential self-intersection. In fact, the complexity comes from the combinatorial behavior of the different possible rigid folding configurations at each vertex. The results underpin the fact that it is harder to fold from an unfolded sheet of paper than to unfold a folded state back to a plane, frequently encountered problem when realizing folding-based systems such as self-folding matters and reconfigurable robots.
more »
« less
- PAR ID:
- 10209599
- Date Published:
- Journal Name:
- Journal of computational geometry
- Volume:
- 11
- Issue:
- 1
- ISSN:
- 1920-180X
- Page Range / eLocation ID:
- 93–124
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
null (Ed.)Given a locally flat-foldable origami crease pattern $G=(V,E)$ (a straight-line drawing of a planar graph on the plane) with a mountain-valley (MV) assignment $$\mu:E\to\{-1,1\}$$ indicating which creases in $$E$$ bend convexly (mountain) or concavely (valley), we may \emph{flip} a face $$F$$ of $$G$$ to create a new MV assignment $$\mu_F$$ which equals $$\mu$$ except for all creases $$e$$ bordering $$F$$, where we have $$\mu_F(e)=-\mu(e)$$. In this paper we explore the configuration space of face flips that preserve local flat-foldability of the MV assignment for a variety of crease patterns $$G$$ that are tilings of the plane. We prove examples where $$\mu_F$$ results in a MV assignment that is either never, sometimes, or always locally flat-foldable, for various choices of $$F$$. We also consider the problem of finding, given two locally flat-foldable MV assignments $$\mu_1$$ and $$\mu_2$$ of a given crease pattern $$G$$, a minimal sequence of face flips to turn $$\mu_1$$ into $$\mu_2$$. We find polynomial-time algorithms for this in the cases where $$G$$ is either a square grid or the Miura-ori, and show that this problem is NP-complete in the case where $$G$$ is the triangle lattice.more » « less
-
Bojanczy, Mikolaj; Chekuri, Chandra (Ed.)One-way functions (OWFs) are central objects of study in cryptography and computational complexity theory. In a seminal work, Liu and Pass (FOCS 2020) proved that the average-case hardness of computing time-bounded Kolmogorov complexity is equivalent to the existence of OWFs. It remained an open problem to establish such an equivalence for the average-case hardness of some natural NP-complete problem. In this paper, we make progress on this question by studying a conditional variant of the Minimum KT-complexity Problem (MKTP), which we call McKTP, as follows. 1) First, we prove that if McKTP is average-case hard on a polynomial fraction of its instances, then there exist OWFs. 2) Then, we observe that McKTP is NP-complete under polynomial-time randomized reductions. 3) Finally, we prove that the existence of OWFs implies the nontrivial average-case hardness of McKTP. Thus the existence of OWFs is inextricably linked to the average-case hardness of this NP-complete problem. In fact, building on recently-announced results of Ren and Santhanam [Rahul Ilango et al., 2021], we show that McKTP is hard-on-average if and only if there are logspace-computable OWFs.more » « less
-
This work presents innovative origami optimization methods for the design of unit cells for complex origami tessellations that can be utilized for the design of deployable structures. The design method used to create origami tiles utilizes the principles of discrete topology optimization for ground structures applied to origami crease patterns. The initial design space shows all possible creases and is given the desired input and output forces. Taking into account foldability constraints derived from Maekawa's and Kawasaki's theorems, the algorithm designates creases as active or passive. Geometric constraints are defined from the target 3D object. The periodic reproduction of this unit cell allows us to create tessellations that are used in the creation of deployable shelters. Design requirements for structurally sound tessellations are discussed and used to evaluate the effectiveness of our results. Future work includes the applications of unit cells and tessellation design for origami inspired mechanisms. Special focus will be given to self-deployable structures, including shelters for natural disasters.more » « less
-
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 interior of the folded material and that are adjacent to four crease lines, i.e. degree-4 vertices, have a single degree of freedom and can be chained together to make flexible polyhedral surfaces. Degree-4 vertices that can fold to a completely flat state have folding kinematics that are very well-understood, and thus they have been used in many engineering and physics applications. However, degree-4 vertices that are not flat-foldable or not folded from flat paper so that the vertex forms either an elliptic or hyperbolic cone, have folding angles at the creases that follow more complicated kinematic equations. In this work we present a new duality between general degree-4 rigid origami vertices, where dual vertices come in elliptic-hyperbolic pairs that have essentially equivalent kinematics. This reveals a mathematical structure in the space of degree-4 rigid origami vertices that can be leveraged in applications, for example in the construction of flexible 3D structures that possess metamaterial properties.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript
- Journal Article:
- The DOI is not currently available.
