Papers › Topology-Agnostic Graph U-Nets for Scalar Field Prediction on Unstructured Meshes

Topology-Agnostic Graph U-Nets for Scalar Field Prediction on Unstructured Meshes

8 Oct 2024arXiv:2410.06406archive 2025-07-28

Kevin Ferguson, Yu-Hsuan Chen, Yiming Chen, Andrew Gillman, James Hardin, Levent Burak Kara

Machine-learned surrogate models to accelerate lengthy computer simulations are becoming increasingly important as engineers look to streamline the product design cycle. In many cases, these approaches offer the ability to predict relevant quantities throughout a geometry, but place constraints on the form of the input data. In a world of diverse data types, a preferred approach would not restrict the input to a particular structure. In this paper, we propose Topology-Agnostic Graph U-Net (TAG U-Net), a graph convolutional network that can be trained to input any mesh or graph structure and output a prediction of a target scalar field at each node. The model constructs coarsened versions of each input graph and performs a set of convolution and pooling operations to predict the node-wise outputs on the original graph. By training on a diverse set of shapes, the model can make strong predictions, even for shapes unlike those seen during training. A 3-D additive manufacturing dataset is presented, containing Laser Powder Bed Fusion simulation results for thousands of parts. The model is demonstrated on this dataset, and it performs well, predicting both 2-D and 3-D scalar fields with a median R-squared > 0.85 on test geometries. Code and datasets are available online.

PaperPDFCode

Code

kevinferg/graph-field-prediction officialmentioned in paperpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

TAG

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Concatenated Skip ConnectionConvolutionMax PoolingReLUSETU-Net

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections