More Like this

1. Ductile Shape-Memory Polymer Composite with Enhanced Shape Recovery Ability

   https://doi.org/10.1021/acsami.0c18413  

   Peng, Kaiyuan; Zhao, Yao; Shahab, Shima; Mirzaeifar, Reza (December 2020, ACS Applied Materials & Interfaces)

   null (Ed.)
2. Polycube Shape Space

   https://doi.org/10.1111/cgf.13839  

   Zhao, Hui; Li, Xuan; Wang, Wencheng; Wang, Xiaoling; Wang, Shaodong; Lei, Na; Gu, Xiangfeng (October 2019, Computer Graphics Forum)
3. Shape-recovering liquids

   https://doi.org/10.1038/s41567-025-02865-1  

   Raykh, Anthony; Paulsen, Joseph D; McGlasson, Alex; Joshi, Chaitanya; Atherton, Timothy J; Kandula, Hima Nagamanasa; Hoagland, David A; Russell, Thomas P (April 2025, Nature Physics)
4. Arithmetizing Shape Analysis

   https://doi.org/10.1007/978-3-031-98668-0_3  

   Wolff, Sebastian; Gupta, Ekanshdeep; Esen, Zafer; Hojjat, Hossein; Rümmer, Philipp; Wies, Thomas (July 2025, Springer Nature Switzerland)

   Abstract Memory safety is a fundamental correctness property of software. For programs that manipulate linked, heap-allocated data structures, ensuring memory safety requires analyzing their possible shapes. Despite significant advances in shape analysis, existing techniques rely on hand-crafted domains tailored to specific data structures, making them difficult to generalize and extend. This paper presents a novel approach that reduces memory-safety proofs to the verification of heap-less imperative programs, enabling the use of off-the-shelf software verification tools. We achieve this reduction through two complementary program instrumentation techniques: space invariants, which enable symbolic reasoning about unbounded heaps, and flow abstraction, which encodes global heap properties as local flow equations. The approach effectively verifies memory safety across a broad range of programs, including concurrent lists and trees that lie beyond the reach of existing shape analysis tools. 

   more » « less
5. Shape-Graph Matching Network (SGM-net): Registration for Statistical Shape Analysis

   https://doi.org/10.1109/ISBI56570.2024.10635203  

   Liang, Shenyuan; Srivastava, Anuj; Segundo, Mauricio Pamplona; Sarkar, Sudeep; Aakur, Sathyanarayanan N (May 2024, IEEE)

   This paper focuses on the registration problem of shape graphs, where a shape graph is a set of nodes connected by articulated curves with arbitrary shapes. This registration requires optimization over the permutation group, made challenging by differences in nodes (in terms of numbers, locations) and edges (in terms of shapes, placements, and sizes) across graphs. We tackle this registration problem using a neuralnetwork architecture with an unsupervised loss function based on the elastic shape metric for curves. This architecture results in (1) state-of-the-art matching performance and (2) an order of magnitude reduction in the computational cost relative to baseline approaches. We demonstrate the effectiveness of the proposed approach using both simulated data and real-world 2D retinal blood vessels and 3D microglia graphs. 

   more » « less