K-d trees for semidynamic point sets
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
New quadric metric for simplifiying meshes with appearance attributes
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
Simplification of Tetrahedral meshes with accurate error evaluation
Proceedings of the conference on Visualization '00
TetFusion: an algorithm for rapid tetrahedral mesh simplification
Proceedings of the conference on Visualization '02
Interactive Time-Dependent Particle Tracing Using Tetrahedral Decomposition
IEEE Transactions on Visualization and Computer Graphics
Generalized Unstructured Decimation
IEEE Computer Graphics and Applications
Volume Decimation of Irregular Tetrahedral Grids
CGI '99 Proceedings of the International Conference on Computer Graphics
Interactive Terascale Particle Visualization
VIS '04 Proceedings of the conference on Visualization '04
Quadric-based simplification in any dimension
ACM Transactions on Graphics (TOG)
A Particle System for Interactive Visualization of 3D Flows
IEEE Transactions on Visualization and Computer Graphics
Efficient Computation and Visualization of Coherent Structures in Fluid Flow Applications
IEEE Transactions on Visualization and Computer Graphics
Interactive Isosurface Ray Tracing of Time-Varying Tetrahedral Volumes
IEEE Transactions on Visualization and Computer Graphics
Generation of Accurate Integral Surfaces in Time-Dependent Vector Fields
IEEE Transactions on Visualization and Computer Graphics
Interactive Blood Damage Analysis for Ventricular Assist Devices
IEEE Transactions on Visualization and Computer Graphics
Interactive Streak Surface Visualization on the GPU
IEEE Transactions on Visualization and Computer Graphics
Time and Streak Surfaces for Flow Visualization in Large Time-Varying Data Sets
IEEE Transactions on Visualization and Computer Graphics
Scalable computation of streamlines on very large datasets
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
An improved algorithm finding nearest neighbor using Kd-trees
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Programming Massively Parallel Processors: A Hands-on Approach
Programming Massively Parallel Processors: A Hands-on Approach
Fast, Memory-Efficient Cell Location in Unstructured Grids for Visualization
IEEE Transactions on Visualization and Computer Graphics
Interactive Separating Streak Surfaces
IEEE Transactions on Visualization and Computer Graphics
Interactive visual exploration of unsteady 3D flows
EUROVIS'07 Proceedings of the 9th Joint Eurographics / IEEE VGTC conference on Visualization
Fast ray traversal of tetrahedral and hexahedral meshes for direct volume rendering
EUROVIS'06 Proceedings of the Eighth Joint Eurographics / IEEE VGTC conference on Visualization
EuroVis'10 Proceedings of the 12th Eurographics / IEEE - VGTC conference on Visualization
Hi-index | 0.00 |
Particle tracing methods are a fundamental class of techniques for vector field visualization. Specifically, interactive particle advection allows the user to rapidly gain an intuitive understanding of flow structures. Yet, it poses challenges in terms of computational cost and memory bandwidth. This is particularly true if the underlying data is time-dependent and represented by a series of unstructured meshes. In this paper, we propose a novel approach which maps the aforementioned computations to modern many-core compute devices in order to achieve parallel, interactive particle advection. The problem of cell location on unstructured tetrahedral meshes is addressed by a two-phase search scheme which is performed entirely on the compute device. In order to cope with limited device memory, the use of data reduction techniques is proposed. A CUDA implementation of the proposed algorithm is evaluated on the basis of one synthetic and two real-world data sets. This particularly includes an assessment of the effects of data reduction on the advection process' accuracy and its performance.