Efficient Algorithms for High Performance Computing

Quasi-SFC ordering of tetrahedra in a refined mesh

Geoscientific simulation applications are among the first and most demanding problems in computational sciences. The research group supports high performance applications by developing efficient algorithms for unstructured mesh generation, grid reordering, and data remapping. One example is the introduction of Sierpinsky space-filling curve ordering for triangular meshes and quasi-SFC ordering for tetrahedral meshes.