SearcharxivSearch

arXiv · 1803.03302

Super Compaction and Pluripotent Shape Transformation via Algorithmic Stacking for 3D Deployable Structures

Abstract

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 the main purpose, namely compactness, of many origami-inspired engineering. In this work, we propose a novel algorithmic kirigami method that provides super compaction of an arbitrary 3D shape with non-negligible surface thickness called "algorithmic stacking". Our approach computationally finds a way of cutting the thick surface of the shape into a strip. This strip forms a Hamiltonian cycle that covers the entire surface and can realize transformation between two target shapes: from a super compact stacked shape to the input 3D shape. Depending on the surface thickness, the stacked structure takes merely 0.001% to 6% of the original volume. This super compacted structure not only can be manufactured in a workspace that is significantly smaller than the provided 3D shape, but also makes packing and transportation easier for a deployable application. We further demonstrate that, the proposed stackable structure also provides high pluripotency and can transform into multiple 3D target shapes if these 3D shapes can be dissected in specific ways and form a common stacked structure. In contrast to many designs of origami structure that usually target at a particular shape, our results provide a universal platform for pluripotent 3D transformable structures.

Explore related subjects

Keep this discovery

BibTeXRIS

Zhonghua Xi, Yu-Ki Lee, Young-Joo Lee, Yun-hyeong Kim, Huangxin Wang, Yue Hao, Young-Chang Joo, In-Suk Choi, Jyh-Ming Lien. 2018-03-08. Super Compaction and Pluripotent Shape Transformation via Algorithmic Stacking for 3D Deployable Structures. https://arxiv.org/abs/1803.03302

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

KEEP EXPLORING

Related papers

Almost Linear Universal Point Sets for Planar Graphs

A point set is universal for planar graphs on $n$ vertices if every such graph has a straight-line drawing without crossings whose vertices belong to the set. We construct universal point sets of size $n^{1+o(1)}$, improving the previous quadratic upper bound. Our construction uses the reduction of Bannister, Cheng, Devanny, and Eppstein from universal point sets to superpatterns for $213$-avoiding permutations. We represent these permutations by ordered rooted forests and construct a small family of intervals containing every such forest. The result follows from a straightforward bound on the size of the family of intervals. GPT-6 Astra assisted in developing the construction and proof.

cs.CG

Some results on Archdeacon's conjecture for rotation systems

A rotation system on $n$ elements assigns to each element a cyclic order of the other $n-1$ elements. A four-element subset is non-planar if its induced rotation system cannot be realized by a crossing-free drawing of $K_4$. As a combinatorial strengthening of Hill's conjecture on the crossing number of the complete graph, Archdeacon conjectured that every rotation system on $n$ elements has at least $H(n)=\frac{1}{4} \lfloor\frac {n}{2}\rfloor \lfloor\frac{n-1}{2}\rfloor \lfloor\frac{n-2}{2}\rfloor \lfloor\frac{n-3}{2}\rfloor$ non-planar four-element subsets. We computationally verify Archdeacon's conjecture for $n\leq 10$ and show that every extremal rotation system in these orders is realizable by a simple drawing. With computer assistance, we prove that every rotation system on $n$ elements has at least $(8/9 - o(1)) H(n)$ non-planar four-element subsets. We also present a proof by hand for a weaker lower bound of $(2/3-o(1)) H(n)$. Finally, extending recent work of Felsner on antipodal pairs in drawings, we show that Archdeacon's conjecture holds for antipodally shellable rotation systems.

cs.CG

The Hyperbolic Surface Distance, Diameter, and Dirichlet Problems

Despite the prominence of hyperbolic surfaces in mathematics, basic algorithmic questions about them, even computing the distance between two points, have remained open, leaving many features of these surfaces inaccessible. The classical machinery assumes a polyhedral structure absent on a smooth surface. We remove these obstacles. We begin with an efficient $O(g^2)$ algorithm for the distance between two points, where $g$ is the genus of the surface. Building on it, we obtain an $O(g^2 \log g)$ method for answering distance queries from a fixed source and, as a consequence, for recentering a Dirichlet domain around an arbitrary point. This understanding of distances on the surface then lets us approximate the diameter to within any $\eps$ in time $O(g^3 \log g / \eps^2)$. We further show that the diameter, a single real number encoding a great deal about the surface, is exactly computable. Its hyperbolic cosine is an algebraic number over the field encoding the coefficients of the hyperbolic isometries defining the surface.

cs.CG