Boundary curvature guided shape-programming kirigami sheets

Yaoye Hong, Yinding Chi, Yanbin Li, Yong Zhu, Jie Yin · arXiv · 2021

By programming curvature along kirigami cut boundaries (not complex cut patterns), the authors enable simpler forward and inverse design of dynamic 3D shape morphing, including magnetic actuation for soft-robot concepts.

High AI ConfidenceGood SourceLaboratory ResearchReadiness Unknown

Plain English summary

Kirigami sheets can morph from 2D to 3D by deforming along cut patterns, but designing cuts to reach a desired 3D curved shape is difficult. This study proposes a different design route: instead of focusing on intricate cut patterns, it programs the curvature of the cut boundaries. The approach is motivated by the Gauss-Bonnet theorem, linking boundary geodesic curvature to topological Gaussian curvature. Using this idea, the authors describe both forward and inverse design strategies to target 3D curved topologies. They report dynamic 3D shape shifting under mechanical stretching and remote magnetic actuation. They also suggest an application as an untethered predator-like kirigami soft robot and position the method as a route to boundary-curvature-encoded shape-programming materials for shape-morphing structures and multifunctional devices.

Why this matters

Programming curvature of cut boundaries (guided by Gauss-Bonnet) rather than using intricate cut patterns for inverse design of target 3D curved kirigami topologies. The abstract does not provide evidence of commercialization, productization, or field deployment; it only mentions demonstrations and potential applications.

Key findings

  • A boundary-curvature programming strategy is used for kirigami shape-programming, reducing reliance on complex cut-pattern inverse design.
  • The method leverages the Gauss-Bonnet theorem to relate boundary geodesic curvature to topological Gaussian curvature for target 3D curved topologies.
  • Dynamic 3D shape shifting is demonstrated under mechanical stretching.
  • Dynamic 3D shape shifting is demonstrated under remote magnetic actuation.
  • The authors propose an untethered predator-like kirigami soft robot application.

Limitations

The abstract does not specify quantitative performance metrics, design constraints, material system details, or the extent of experimental validation beyond the reported demonstrations and suggested robot application.

Publication

Publisher
arXiv
Publication date
March 20, 2021
Research type
Preprint
arXiv
2103.11076
Access
open

Tags

More on Programmable Materials

See all →
Programmable Materialspaper· Jul 1, 2026

Shape optimization of 4D-printed multi-material morphing structures for enhanced structural stability

This study presents a shape optimization framework for enhancing the stiffness of 4D-printed multi-material morphing structures.

Hoo Min Lee, Chang-Min Lee +2 · IOP PublishingWorking Prototype
Programmable Materialspaper· Jun 22, 2026

A Versatile‐Designable Framework for Active and Programmable Shape‐Morphing Soft Matter Systems: From Inverse Design to Closed‐Loop Control

This research presents a framework for active and programmable shape-morphing soft matter systems, enhancing soft robotics capabilities.

Kai Liu, Peiling Xie +4 · WileyLaboratory Research
Programmable Materialspaper· Jun 5, 2026

Architecting three-dimensional reconfigurable matter from pop-up kirigami with programmable multistability

This research presents a new platform for creating programmable multistable pop-up kirigami systems that can transform into complex 3D shapes.

Tong Zhou, Chong Huang +5 · American Association for the Advancement of Science (AAAS)Concept
Programmable Materialspreprint· May 2, 2026

Dimple-Encoded Reprogrammable Origami

This research presents a dimple-encoded origami platform that allows for reprogrammable shape-morphing and adaptive mechanical systems.

Qun Zhang, Weicheng Huang +5 · arXivLaboratory Research
Programmable Materialspreprint· Apr 30, 2026

Geometric memory in incomplete phase transitions across dimensions

A nucleation-and-growth model with incomplete reversion produces a geometric memory in plate-size distributions, with stronger memory in 2D than in 3D or lamellar geometries.

F. Tolea, M. Tolea · APS Open Sci. 1, 000005 (2026)Simulation
Programmable Materialspreprint· Apr 17, 2026

Logarithmic-Time Geodesically Convex Decomposition in Programmable Matter

It presents an O(log n)-round algorithm to decompose arbitrary amoebot programmable-matter structures into O(|H|) geodesically convex regions using reconfigurable circuits.

Henning Hillebrandt, Andreas Padalkin +3 · arXivSimulation
Method note: Summaries and ratings on this page are generated by AI from the abstract only. Read the original paper for full context. · Model: gpt-5.4-nano-2026-03-17