EG2021
Permanent URI for this community
Browse
Browsing EG2021 by Author "Benthin, Carsten"
Now showing 1 - 2 of 2
Results Per Page
Sort Options
Item Ray Tracing Lossy Compressed Grid Primitives(The Eurographics Association, 2021) Benthin, Carsten; Vaidyanathan, Karthik; Woop, Sven; Theisel, Holger and Wimmer, MichaelWe propose a new watertight representation of geometry for ray tracing highly complex scenes in a memory efficient manner. Polygon meshes in the scene are first converted into compressed grid primitives, which are represented by a base bilinear patch with quantized displacement vectors. Ray-scene intersections are then computed by efficiently decompressing these grids onthe- fly and intersecting the implicit triangles. Our representation requires just 5:4??6:6 bytes per triangle for the combined geometry and acceleration structure, resulting in a 5-7x reduction in memory footprint compared to indexed triangle meshes. This is achieved with less than 15% increase in rendering time.Item A Survey on Bounding Volume Hierarchies for Ray Tracing(The Eurographics Association and John Wiley & Sons Ltd., 2021) Meister, Daniel; Ogaki, Shinji; Benthin, Carsten; Doyle, Michael J.; Guthe, Michael; Bittner, Jirí; Bühler, Katja and Rushmeier, HollyRay tracing is an inherent part of photorealistic image synthesis algorithms. The problem of ray tracing is to find the nearest intersection with a given ray and scene. Although this geometric operation is relatively simple, in practice, we have to evaluate billions of such operations as the scene consists of millions of primitives, and the image synthesis algorithms require a high number of samples to provide a plausible result. Thus, scene primitives are commonly arranged in spatial data structures to accelerate the search. In the last two decades, the bounding volume hierarchy (BVH) has become the de facto standard acceleration data structure for ray tracing-based rendering algorithms in offline and recently also in real-time applications. In this report, we review the basic principles of bounding volume hierarchies as well as advanced state of the art methods with a focus on the construction and traversal. Furthermore, we discuss industrial frameworks, specialized hardware architectures, other applications of bounding volume hierarchies, best practices, and related open problems.