Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleOctober 2023
Attribute-Aware RBFs: Interactive Visualization of Time Series Particle Volumes Using RT Core Range Queries
IEEE Transactions on Visualization and Computer Graphics (ITVC), Volume 30, Issue 1Jan. 2024, Pages 1150–1160https://doi.org/10.1109/TVCG.2023.3327366Smoothed-particle hydrodynamics (SPH) is a mesh-free method used to simulate volumetric media in fluids, astrophysics, and solid mechanics. Visualizing these simulations is problematic because these datasets often contain millions, if not billions of ...
- research-articleJanuary 2022
A Memory Efficient Encoding for Ray Tracing Large Unstructured Data
IEEE Transactions on Visualization and Computer Graphics (ITVC), Volume 28, Issue 1Jan. 2022, Pages 583–592https://doi.org/10.1109/TVCG.2021.3114869In theory, efficient and high-quality rendering of unstructured data should greatly benefit from modern GPUs, but in practice, GPUs are often limited by the large amount of memory that large meshes require for element representation and for sample ...
- research-articleAugust 2020
Using Hardware Ray Transforms to Accelerate Ray/Primitive Intersections for Long, Thin Primitive Types
Proceedings of the ACM on Computer Graphics and Interactive Techniques (PACMCGIT), Volume 3, Issue 2Article No.: 17, Pages 1–16https://doi.org/10.1145/3406179With the recent addition of hardware ray tracing capabilities, GPUs have become incredibly efficient at ray tracing both triangular geometry, and instances thereof. However, the bounding volume hierarchies that current ray tracing hardware relies on are ...
- research-articleJune 2018
Rapid k-d tree construction for sparse volume data
EGPGV '18: Proceedings of the Symposium on Parallel Graphics and VisualizationJune 2018, Pages 69–77While k-d trees are known to be effective for spatial indexing of sparse 3-D volume data, full reconstruction, e.g. due to changes to the alpha transfer function during rendering, is usually a costly operation with this hierarchical data structure. We ...
- research-articleSeptember 2017
C++ compile time polymorphism for ray tracing
VMV '17: Proceedings of the conference on Vision, Modeling and VisualizationSeptember 2017, Pages 129–136https://doi.org/10.2312/vmv.20171268Reducing the amount of conditional branching instructions in innermost loops is crucial for high performance code on contemporary hardware architectures. In the context of ray tracing algorithms, typical examples for branching in inner loops are the ...
- articleSeptember 2015
Asymptotic error of cubic B-spline interpolation using prefiltering
Numerical Algorithms (SPNA), Volume 70, Issue 1September 2015, Pages 191–203https://doi.org/10.1007/s11075-014-9941-xA popular class of reconstruction filters that are used in signal and image processing is based on cubic B-splines. One reason for their popularity is the fact that they can be efficiently implemented. This is specifically true with modern GPUs where ...