Transformations of Computational Meshes
Matthew G. Knepley

TL;DR
This paper introduces a simple, table-driven approach for efficiently transforming computational meshes, facilitating various modifications in PDE simulations with improved performance and maintainability.
Contribution
It presents a novel, unified paradigm for mesh transformations that simplifies implementation and enhances performance in PDE simulation workflows.
Findings
Efficient parallel execution of mesh transformations.
Versatile transformations handled by a unified table-driven method.
Open source implementation in PETSc available for experimentation.
Abstract
Computational meshes, as a way to partition space, form the basis of much of PDE simulation technology, for instance for the finite element and finite volume discretization methods. In complex simulations, we are often driven to modify an input mesh, for example, to refine, coarsen, extrude, change cell types, or filter it. Mesh manipulation code can be voluminous, error-prone, spread over many special cases, and hard to understand and maintain by subsequent developers. We present a simple, table-driven paradigm for mesh transformation which can execute a large variety of transformations in a performant, parallel manner, along with experiments in the open source library PETSc which can be run by the reader.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · VLSI and FPGA Design Techniques · Computer Graphics and Visualization Techniques
