Dubois, JérômeLekien, Jacques-BernardJohansson, Jimmy and Sadlo, Filip and Marai, G. Elisabeta2019-06-022019-06-022019978-3-03868-090-1https://doi.org/10.2312/evs.20191167https://diglib.eg.org:443/handle/10.2312/evs20191167With the constant increase in compute power of supercomputers, high performance computing simulations are producing higher fidelity results and possibly massive amounts of data. To keep visualization of such results interactive, existing techniques such as Adaptive Mesh Refinement (AMR) can be of use. In particular, Tree-Based AMR methods (TB-AMR) are widespread in simulations and are becoming more present in general purpose visualization pipelines such as VTK. In this work, we show how TB-AMR data structures could lead to more efficient exploration of massive data sets in the Exascale era. We discuss how algorithms (filters) should be designed to take advantage of tree-like data structures for both data filtering or rendering. By introducing controlled hierarchical data reduction we greatly reduce the processing time for existing algorithms, sometimes with no visual impact, and drastically decrease exploration time for analysts. Also thanks to the techniques and implementations we propose, visualization of very large data is made possible on very constrained resources. These ideas are illustrated on million to billion-scale native TB-AMR or resampled meshes, with the HyperTreeGrid object and associated filters we have recently optimized and made available in the Visualisation Toolkit (VTK) for use by the scientific community.General and referenceDesignPerformanceEvaluationHumancentered computingVisualizationSoftware and its engineeringDesigning softwareInformation systemsData compression10.2312/evs.2019116737-41