Jan 2026· arXiv.org· Vol abs/2601.23177· 9 citations· 39 references
Computer Science
TL;DR
MeshGraphNet-Transformer (MGN-T) is presented, a novel architecture that combines the global modeling capabilities of Transformers with the geometric inductive bias of MeshGraphNets, while preserving a mesh-based graph representation, and outperforms state-of-the-art approaches on classical benchmarks.
Abstract
We present MeshGraphNet-Transformer (MGN-T), a novel architecture that combines the global modeling capabilities of Transformers with the geometric inductive bias of MeshGraphNets, while preserving a mesh-based graph representation. MGN-T overcomes a key limitation of standard MGN, the inefficient long-range information propagation caused by iterative message passing on large, high-resolution meshes. A physics-attention Transformer serves as a global processor, updating all nodal states simultaneously while explicitly retaining node and edge attributes. By directly capturing long-range physical interactions, MGN-T eliminates the need for deep message-passing stacks or hierarchical, coarsened meshes, enabling efficient learning on high-resolution meshes with varying geometries, topologies, and boundary conditions at an industrial scale. We demonstrate that MGN-T successfully handles industrial-scale meshes for impact dynamics, a setting in which standard MGN fails due message-passing under-reaching. The method accurately models self-contact, plasticity, and multivariate outputs, including internal, phenomenological plastic variables. Moreover, MGN-T outperforms state-of-the-art approaches on classical benchmarks, achieving higher accuracy while maintaining practical efficiency, using only a fraction of the parameters required by competing baselines.
Hierarchical Interpolating MeshGraphNets (HI-MGN), a multiscale extension of MeshGraphNets for efficient long-range communication on unstructured meshes that replaces the flat processor with a hierarchical multiscale processor that coarsens graphs using farthest-point sampling and Voronoi partitioning while preserving...
Sihun Lee, D. Park, Taesoo Bang et al.· 0 citations
Generating compact, artist-style meshes with explicit topology typically relies on autoregressive models which incur prohibitive sequential per-token costs, or continuous flow models that depend on heuristic connectivity decoders. Next-scale generation paradigms offer a compelling alternative by enabling parallel intra...
Jun-Kai Lin, Tian-Hao Zhao, Hang Long et al.· 0 citations
This paper introduces an adaptive mesh-based optimization framework and a practical mesh rendering technique that significantly outperforms existing mesh optimization approaches across a variety of object-centric benchmarks while being competitive with state-of-the-art NeRF/3DGS methods.
Johannes Weidenfeller, Shaofei Wang, P. Fürnstahl et al.· 0 citations
We present a neural method for adaptive triangle mesh refinement, in which an autoregressive model adds geometric detail to selected regions of an input mesh while leaving the rest unchanged, a key capability for efficiently allocating mesh budget. Existing upsampling methods struggle to achieve this. Classical subdivi...
Xiao Zhan, Chrystiano Araújo, Kang-Le Deng et al.· 0 citations
Recent mesh-based simulation advances have, in no small part, relied on neural surrogates of two distinct families: global models that route information through a small set of latent tokens, and local models that perform message passing across mesh edges. Consistent with both classes is the inability to perform beyond...
Anuj Kumar, Heiko Zimmermann, J. Bjorgaard et al.· 0 citations
Assistant Professor Benjamin Lindquist studies how engineers deliberately injected randomness into early AI, giving rise to deep-learning models that sometimes hallucinate.