Efficient visualization and analysis of large-scale, tree-based, adaptive mesh refinement simulations with rectilinear geometry

Guénolé Harel (1) , Jacques-Bernard Lekien (1) , Philippe P Pébaÿ (2) , Jérôme Dubois (1)

1 DAM/DIF - DAM Île-de-France
2 NGA - NexGen Analytics

We present the first systematic treatment of the problems posed by the visualization and analysis of large-scale, parallel tree-based adaptive mesh refinement (AMR) simulations on an Eulerian grid. When compared to those obtained by constructing an intermediate unstructured mesh with fully described connectivity, our primary results indicate a gain of at least 80% in terms of memory footprint, with a better rendering while retaining similar execution speed. We thus describe herein the key concepts that allowed us to obtain these results, together with the methodology that facilitates the design, implementation, and optimization of algorithms operating directly on such refined meshes. In 2019, this native support for AMR meshes has been contributed to the open source Visualization Toolkit (VTK). We note that this work pertains to a broader long-term vision, with the dual goal to both improve interactivity when exploring such data sets in 2 and 3 dimensions, and optimize resource utilization.

Keywords: scientific visualization; meshing; AMR; mesh refinement; tree-based; octree; VTK; parallel visualization; large scale visualization; HPC; isocoutour; isosurface Contents

Domains: Computational Geometry [cs.CG]; Distributed, Parallel, and Cluster Computing [cs.DC]; Data Structures and Algorithms [cs.DS]; Modeling and Simulation

Guénolé Harel, Jacques-Bernard Lekien, Philippe P Pébaÿ, Jérôme Dubois. Efficient visualization and analysis of large-scale, tree-based, adaptive mesh refinement simulations with rectilinear geometry. [Research Report] CEA. 2019. ⟨cea-03501320⟩