Memory‐Efficient GPU Volume Path Tracing of AMR Data Using the Dual Mesh
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 …
the dual mesh and visualize that with a standard unstructured element renderer. While the …
Visualization of Large Non-Trivially Partitioned Unstructured Data with Native Distribution on High-Performance Computing Systems
Interactively visualizing large finite element simulation data on High-Performance
Computing (HPC) systems poses several difficulties. Some of these relate to unstructured …
Computing (HPC) systems poses several difficulties. Some of these relate to unstructured …
Quick clusters: A GPU-parallel partitioning for efficient path tracing of unstructured volumetric grids
We propose a simple yet effective method for clustering finite elements to improve
preprocessing times and rendering performance of unstructured volumetric grids without …
preprocessing times and rendering performance of unstructured volumetric grids without …
MFA-DVR: direct volume rendering of MFA models
Abstract 3D volume rendering is widely used to reveal insightful intrinsic patterns of
volumetric datasets across many domains. However, the complex structures and varying …
volumetric datasets across many domains. However, the complex structures and varying …
A task-parallel approach for localized topological data structures
Unstructured meshes are characterized by data points irregularly distributed in the Euclidian
space. Due to the irregular nature of these data, computing connectivity information between …
space. Due to the irregular nature of these data, computing connectivity information between …
State‐of‐the‐art in Large‐Scale Volume Visualization Beyond Structured Data
Volume data these days is usually massive in terms of its topology, multiple fields, or
temporal component. With the gap between compute and memory performance widening …
temporal component. With the gap between compute and memory performance widening …
GPU-based data-parallel rendering of large, unstructured, and non-convexly partitioned data
Computational fluid dynamic simulations often produce large clusters of finite elements with
non-trivial, non-convex boundaries and uneven distributions among compute nodes, posing …
non-trivial, non-convex boundaries and uneven distributions among compute nodes, posing …
Hybrid image-/data-parallel rendering using island parallelism
In parallel ray tracing, techniques fall into one of two camps: image-parallel techniques aim
at increasing frame rate by replicating scene data across nodes and splitting the rendering …
at increasing frame rate by replicating scene data across nodes and splitting the rendering …
Compact tetrahedralization-based acceleration structures for ray tracing
We propose compact and efficient tetrahedral mesh representations to improve the ray-
tracing performance. We reorder tetrahedral mesh data using a space-filling curve to …
tracing performance. We reorder tetrahedral mesh data using a space-filling curve to …
Shortest Path to Boundary for Self-Intersecting Meshes
We introduce a method for efficiently computing the exact shortest path to the boundary of a
mesh from a given internal point in the presence of self-intersections. We provide a formal …
mesh from a given internal point in the presence of self-intersections. We provide a formal …