MAGNET: an open-source library for mesh agglomeration by graph neural networks

Abstract We introduce , an open-source Python library designed for mesh agglomeration in both two- and three-dimensions, based on employing Graph Neural Networks (GNN). serves as a comprehensive solution for training a variety of GNN models, integrating deep learning and other advanced algorithms such as METIS and k-means to facilitate mesh agglomeration and quality metric computation. The library’s introduction is outlined through its code structure and primary features. The GNN framework adopts a graph bisection methodology that capitalizes on connectivity and geometric mesh information via SAGE convolutional layers, in line with the methodology proposed in (Antonietti and Manuzzi in J Comput Phys 452:110900, 2022; Antonietti et al. in Polytopal mesh agglomeration via geometrical deep learning for three-dimensional heterogeneous domains, arXiv:2406.10587 , 2024). Additionally, the proposed library incorporates reinforcement learning to enhance the accuracy and robustness of the model initially suggested in [1, 2] for predicting coarse partitions within a multilevel framework. A detailed tutorial is provided to guide the user through the process of mesh agglomeration and the training of a GNN bisection model. We present several examples of mesh agglomeration conducted by , demonstrating the library’s applicability across various scenarios. Furthermore, the performance of the newly introduced models is contrasted with that of METIS and k-means, illustrating that the proposed GNN models are competitive regarding partition quality and computational efficiency. Finally, we exhibit the versatility of ’s interface through its integration with , an open-source library implementing discontinuous Galerkin methods on polytopal grids for the numerical discretization of multiphysics differential problems.

Authors

Institutions

Publication Details

Journal
Engineering With Computers
Published
2025-10-27
DOI
https://doi.org/10.1007/s00366-025-02223-y
Primary Topic
Computer Graphics and Visualization Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

MAGNET: an open-source library for mesh agglomeration by graph neural networks

Matteo Caldana, Ilario Mazzieri, Paola F. Antonietti, Andrea Re Fraschini
Engineering With Computers
Computer Graphics and Visualization Techniques
article

MAGNET: an open-source library for mesh agglomeration by graph neural networks

Matteo Caldana, Ilario Mazzieri, Paola F. Antonietti, Andrea Re Fraschini
article en

Abstract

Abstract We introduce , an open-source Python library designed for mesh agglomeration in both two- and three-dimensions, based on employing Graph Neural Networks (GNN). serves as a comprehensive solution for training a variety of GNN models, integrating deep learning and other advanced algorithms such as METIS and k-means to facilitate mesh agglomeration and quality metric computation. The library’s introduction is outlined through its code structure and primary features. The GNN framework adopts a graph bisection methodology that capitalizes on connectivity and geometric mesh information via SAGE convolutional layers, in line with the methodology proposed in (Antonietti and Manuzzi in J Comput Phys 452:110900, 2022; Antonietti et al. in Polytopal mesh agglomeration via geometrical deep learning for three-dimensional heterogeneous domains, arXiv:2406.10587 , 2024). Additionally, the proposed library incorporates reinforcement learning to enhance the accuracy and robustness of the model initially suggested in [1, 2] for predicting coarse partitions within a multilevel framework. A detailed tutorial is provided to guide the user through the process of mesh agglomeration and the training of a GNN bisection model. We present several examples of mesh agglomeration conducted by , demonstrating the library’s applicability across various scenarios. Furthermore, the performance of the newly introduced models is contrasted with that of METIS and k-means, illustrating that the proposed GNN models are competitive regarding partition quality and computational efficiency. Finally, we exhibit the versatility of ’s interface through its integration with , an open-source library implementing discontinuous Galerkin methods on polytopal grids for the numerical discretization of multiphysics differential problems.

Engineering With ComputersVol. 41(6)
Politecnico di Milano (IT)
Istituto Nazionale di Alta Matematica "Francesco Severi", National Institutes of Health, Gruppo Nazionale per il Calcolo Scientifico
Openalex Percentile: Top 46%
Computer Graphics and Visualization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.