Venue
SMI 2026
Abstract
Geometric multigrid (GMG) methods are a fundamental tool for efficiently solving large sparse linear systems. A requirement for GMG is a hierarchy of grids; however, many practical volumetric domains are available only as single, irregular tetrahedral meshes, making the construction of a multigrid hierarchy necessary. Existing approaches often trade off speed against hierarchy quality: remeshing- or coarsening-based methods can be expensive to construct, whereas graph-based techniques are fast but often yield weaker multigrid performance. We introduce GravoTet, which bridges this gap by combining geometric structure with graph‑based efficiency to construct fast and effective multigrid hierarchies. GravoTet builds a vertex hierarchy and then generates graph‑Voronoi diagrams whose dual cells define coarse tetrahedra, enabling rapid construction of multigrid levels. Boundary elements are explicitly prioritized during both sampling and tet generation to preserve boundary. In our evaluation, we solve Poisson and biharmonic problems on irregular tetrahedral meshes and compare GravoTet against state‑of‑the‑art geometric multigrid, algebraic multigrid and direct solvers, demonstrating superior performance, particularly on large meshes.
Tags
Cite
@article{padilla2026gravotet,
author = {Padilla, Marcel and Wiersma, Ruben and Huisman, Tim and Campolattaro, Jackson and Sorkine-Hornung, Olga and Hildebrandt, Klaus},
title={GravoTet: A Fast Multigrid Hierarchy Construction for Tetrahedral Meshes},
year = {2026},
publisher = {Elsevier},
journal = {Elsevier Computers and Graphics},
}
Ruben Wiersma