Search arXivSearch

arXiv · 2107.05139

Graph-theoretic estimation of reconfigurability in origami-based metamaterials

Abstract

Origami-based mechanical metamaterials have recently received significant scientific interest due to their versatile and reconfigurable architectures. However, it is often challenging to account for all possible geometrical configurations of the origami assembly when each origami cell can take multiple phases. Here, we investigate the reconfigurability of a tessellation of origami-based cellular structures composed of bellows-like unit cells, specifically Tachi-Miura Polyhedron (TMP). One of the unique features of the TMP is that a single cell can take four different phases in a rigid foldable manner. Therefore, the TMP tessellation can achieve various shapes out of one originally given assembly. To assess the geometrical validity of the astronomical number of origami phase combinations, we build a graph-theoretical framework to describe the connectivity of unit cells and to analyze the reconfigurability of the tessellations. Our approach can pave the way to develop a systematic computational tool to design origami-based mechanical metamaterials with tailored properties.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Koshiro Yamaguchi, Hiromi Yasuda, Kosei Tsujikawa, Takahiro Kunimine, Jinkyu Yang. 2021-07-11. Graph-theoretic estimation of reconfigurability in origami-based metamaterials. https://arxiv.org/abs/2107.05139

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO