Related papers: Minimum Forcing Sets for Miura Folding Patterns
Following on Part I of this work series on local kirigami mechanics, we present a study of a discretely creased mechanism as a model to investigate the mechanics of the basic geometric building block of kirigami--the e-cone. We consider an…
We present an approach to overcoming challenges in dynamical dexterity for robots through tunable origami structures. Our work leverages a one-parameter family of flat sheet crease patterns that folds into origami bellows, whose axial…
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…
Origami designs and structures have been widely used in many fields, such as morphing structures, robotics, and metamaterials. However, the design and fabrication of origami structures rely on human experiences and skills, which are both…
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…
Origami design principles are scale invariant and enable direct miniaturization of origami structures provided the sheets used for folding have equal thickness to length ratios. Recently, seminal steps have been taken to fabricate…
Deployable structures inspired by origami have provided lightweight, compact, and reconfigurable solutions for various robotic and architectural applications. However, creating an integrated structural system that can effectively balance…
Computing a minimum-area planar straight-line drawing of a graph is known to be NP-hard for planar graphs, even when restricted to outerplanar graphs. However, the complexity question is open for trees. Only a few hardness results are known…
The zero forcing number Z(G), which is the minimum number of vertices in a zero forcing set of a graph G, is used to study the maximum nullity / minimum rank of the family of symmetric matrices described by G. It is shown that for a…
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…
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…
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…
Fuzzy rough set theory can be used as a tool for dealing with inconsistent data when there is a gradual notion of indiscernibility between objects. It does this by providing lower and upper approximations of concepts. In classical fuzzy…
Origami structures enabled by folding and unfolding can create complex 3D shapes. However, even a small 3D shape can have large 2D unfoldings. The huge initial dimension of the 2D flattened structure makes fabrication difficult, and defeats…
Zero forcing is an iterative graph coloring process whereby a colored vertex with a single uncolored neighbor forces that neighbor to be colored. It is NP-hard to find a minimum zero forcing set - a smallest set of initially colored…
This paper aims to understand the role of directional material properties on the mechanical responses of origami structures. We consider the Miura-Ori structures our target model due to their collapsibility and negative Poisson's ratio…
We construct a Fourier--Mukai transform for smooth complex vector bundles $E$ over a torus bundle $\pi:M \to B,$ the vector bundles being endowed with various structures of increasing complexity. At a minimum, we consider vector bundles $E$…
We give an algorithm that finds a zero forcing set which approximates the optimal size by a factor of $\text{pw}(G)+1$, where $\text{pw}(G)$ is the pathwidth of $G$. Starting from a path decomposition, the algorithm runs in $O(nm)$ time,…
The study of origami-based mechanical metamaterials usually focuses on the kinematics of deployable structures made of an assembly of rigid flat plates connected by hinges. When the elastic response of each panel is taken into account,…
This study proposes a reconfigurable modular building system that assembles multistable curved-crease origami blocks. Curved-crease origami is designed with even-vertex polygonal trajectories and an elastica curvature profile. We then…