Memory-Efficient GPU Volume Path Tracing of AMR Data Using the Dual Mesh
Stefan Zellmann, Qi Wu, Kwan-Liu Ma, and Ingo Wald
The Eurographics Conference on Visualization (EuroVis), 2023
PDF ArXiv Version Publisher's Version Code
Abstract
A common way to render cell-centric adaptive mesh refinement (AMR) data is to compute the dual mesh and visualize that with a standard unstructured element renderer. While the dual mesh provides a high-quality interpolator, the memory requirements of the dual mesh data structure are significantly higher than those of the original grid, which prevents rendering very large data sets. We introduce a GPU-friendly data structure and a clustering algorithm that allow for efficient AMR dual mesh rendering with a competitive memory footprint. Fundamentally, any off-the-shelf unstructured element renderer running on GPUs could be extended to support our data structure just by adding a gridlet element type in addition to the standard tetrahedra, pyramids, wedges, and hexahedra supported by default. We integrated the data structure into a volumetric path tracer to compare it to various state-of-the-art unstructured element sampling methods. We show that our data structure easily competes with these method in terms of rendering performance, but is much more memory-efficient.
BibTex
@article{zellmann2023memory,
journal = {Computer Graphics Forum},
title = {{Memory-Efficient GPU Volume Path Tracing of AMR Data Using the Dual Mesh}},
author = {Zellmann, Stefan and Wu, Qi and Ma, Kwan-Liu and Wald, Ingo},
year = {2023},
publisher = {The Eurographics Association and John Wiley & Sons Ltd.},
ISSN = {1467-8659},
DOI = {10.1111/cgf.14811}
}