Abstract

Kirigami tessellations, regular planar patterns formed by partially cutting flat, thin sheets, allow compact shapes to morph into open structures with rich geometries and unusual material properties. However, geometric and topological constraints make the design of such structures challenging. Here we pose and solve the inverse problem of determining the number, size and orientation of cuts that enables the deployment of a closed, compact regular kirigami tessellation to conform approximately to any prescribed target shape in two or three dimensions. We first identify the constraints on the lengths and angles of generalized kirigami tessellations that guarantee that their reconfigured face geometries can be contracted from a non-trivial deployed shape to a compact, non-overlapping planar cut pattern. We then encode these conditions into a flexible constrained optimization framework to obtain generalized kirigami patterns derived from various periodic tesselations of the plane that can be deployed into a wide variety of prescribed shapes. A simple mechanical analysis of the resulting structure allows us to determine and control the stability of the deployed state and control the deployment path. Finally, we fabricate physical models that deploy in two and three dimensions to validate this inverse design approach. Altogether, our approach, combining geometry, topology and optimization, highlights the potential for generalized kirigami tessellations as building blocks for shape-morphing mechanical metamaterials.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.