Ray Traced Volume Clipping Using Multi-Hit BVH Traversal

Zellmann, Stefan; Hoevels, Mauritius; Lang, Ulrich

doi:10.2352/issn.2470-1173.2017.1.vda-392

Cited by 5 publications

(3 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the client, we transform those samples to a point cloud that we render using first-hit ray tracing. We also experimented with multi-hit ray tracing [ZHL17], but as the results regarding image quality were mixed, we stuck with this simple approach that just colorizes each sphere according to its designated pixel color.…”

Section: Methodsmentioning

confidence: 99%

Augmenting Image Warping-Based Remote Volume Rendering with Ray Tracing

Zellmann

2020

Preprint

Self Cite

View full text Add to dashboard Cite

<div><div><div><p>We propose an image warping-based remote rendering technique for volumes that decouples the rendering and display phases. Our work builds on prior work that samples the volume on the client using ray casting and reconstructs a z-value based on some heuristic. The color and depth buffer are then sent to the client that reuses this depth image as a stand-in for subsequent frames by warping it according to the current camera position until new data was received from the server. We augment that method by implementing the client renderer using ray tracing. By representing the pixel contributions as spheres, this allows us to effectively vary their footprint based on the distance to the viewer, which we find to give better results than point-based rasterization when applied to volumetric data sets.</p></div></div></div>

show abstract

Section: Methodsmentioning

confidence: 99%

Augmenting Image Warping-Based Remote Volume Rendering with Ray Tracing

Zellmann

2020

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…Visionaray provides support for several features that are required to develop ray tracing algorithms, such as a streamlined texture interface that can be leveraged on both CPUs with vector instructions as well as on NVIDIA GPUs [ZPL15]. Visionaray supports several types of intersection queries, including the multi-hit query type [ZHL17]. Support for multiple primitive, material or light types in the same ray tracing program is provided by means of compile type polymorphism.…”

Section: Related Workmentioning

confidence: 99%

Adding Custom Intersectors to the C++ Ray Tracing Template Library Visionaray

Zellmann¹

2020

Preprint

Self Cite

View full text Add to dashboard Cite

Figure 1: Use cases where ray tracing algorithms were extended using custom intersectors. From left to right: billboards, the alpha mask stored in the billboard images is ignored. Second from left: the alpha mask from the billboard images is used to conditionally continue BVH traversal when the surface has zero opacity near the hit point. Second from right: procedural alpha mask applied using custom intersectors. Right: debug image, the number of BVH nodes and the number of primitives inside the encountered leaf nodes is used to generate a heat map. This is done by intercepting the BVH traversal routine with a custom intersector that counts the number of ray object interactions. AbstractMost ray tracing libraries allow the user to provide custom functionality that is executed when a potential ray surface interaction was encountered to determine if the interaction was valid or traversal should be continued. This is e.g. useful for alpha mask validation and allows the user to reuse existing ray object intersection routines rather than reimplementing them. Augmenting ray traversal with custom intersection logic requires some kind of callback mechanism that injects user code into existing library routines. With template libraries, this injection can happen statically since the user compiles the binary code herself. We present an implementation of this "custom intersector" approach and its integration into the C++ ray tracing template library Visionaray.

show abstract

“…[WH06, Wal07, Kar12, GHFB13, MB18]. While some researchers have used acceleration data structures to implement volume rendering algorithms in the past [ZHL17], with the advent of hardware accelerated ray tracing on modern GPUs it is likely that the two research branches that are concerned with surface ray tracing on the one hand, and with volume ray casting on the other hand, are going to converge in the future.…”

Section: Related Workmentioning

confidence: 99%

Comparing Hierarchical Data Structures for Sparse Volume Rendering with Empty Space Skipping

Zellmann¹

2019

Preprint

Self Cite

View full text Add to dashboard Cite

Empty space skipping can be efficiently implemented with hierarchical data structures such as k-d trees and bounding volume hierarchies. This paper compares several recently published hierarchical data structures with regard to construction and rendering performance. The papers that form our prior work have primarily focused on interactively building the data structures and only showed that rendering performance is superior to using simple acceleration data structures such as uniform grids with macro cells. In the area of surface ray tracing, there exists a trade-off between construction and rendering performance of hierarchical data structures. In this paper we present performance comparisons for several empty space skipping data structures in order to determine if such a trade-off also exists for volume rendering with uniform data topologies.

show abstract

Ray Traced Volume Clipping Using Multi-Hit BVH Traversal

Cited by 5 publications

References 33 publications

Augmenting Image Warping-Based Remote Volume Rendering with Ray Tracing

Augmenting Image Warping-Based Remote Volume Rendering with Ray Tracing

Adding Custom Intersectors to the C++ Ray Tracing Template Library Visionaray

Comparing Hierarchical Data Structures for Sparse Volume Rendering with Empty Space Skipping

Contact Info

Product

Resources

About