اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدRigid Origami Vertices: Conditions and Forcing Sets
451
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 in the unassigned case. We also illustrate the utility of this result by applying it to the new concept of minimal forcing sets for rigid origami models, which are the smallest collection of creases that, when folded, will force all the other creases to fold in a prescribed way.
قيم البحث
اقرأ أيضاً
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 e
quations for the folding angles of a flat-foldable degree-4 origami vertex. We extend this work to generalized symmetries of the degree-6 vertex where all sector angles equal $60^circ$. We enumerate the different viable rigid folding modes of these degree-6 crease patterns and then use $2^{nd}$-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 modeling rigid origami. These results expand the toolbox of rigid origami mechanisms that engineers and materials scientists may use in origami-inspired designs.
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 all the othe
r creases to fold according to their labels. The result is a flat folding of the origami material. In this paper we develop a linear time algorithm that finds minimum forcing sets in one dimensional origami.
In this paper, we will show methods to interpret some rigid origami with higher degree vertices as the limit case of structures with degree-4 supplementary angle vertices. The interpretation is based on separating each crease into two parallel crease
s, or emph{double lines}, connected by additional structures at the vertex. We show that double-lin
Inspired by the classical Riemannian systolic inequality of Gromov we present a combinatorial analogue providing a lower bound on the number of vertices of a simplicial complex in terms of its edge-path systole. Similarly to the Riemannian case, wher
e the inequality holds under a topological assumption of ``essentiality, our proofs rely on a combinatorial analogue of that assumption. Under a stronger assumption, expressed in terms of cohomology cup-length, we improve our results quantitatively. We also illustrate our methods in the continuous setting, generalizing and improving quantitatively the Minkowski principle of Balacheff and Karam; a corollary of this result is the extension of the Guth--Nakamura cup-length systolic bound from manifolds to complexes.
Define the augmented square twist origami crease pattern to be the classic square twist crease pattern with one crease added along a diagonal of the twisted square. In this paper we fully describe the rigid foldability of this new crease pattern. Spe
cifically, the extra crease allows the square twist to rigidly fold in ways the original cannot. We prove that there are exactly four non-degenerate rigid foldings of this crease pattern from the unfolded state.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
