CBCarsten Benthin

Carsten Benthin

*This is an algorithmically generated author record based on publicly available information.

Carsten Benthin has a total of 18 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Ray Tracing Massive Amounts of Animated Geometry 49

    by Holger Gruen, Carsten Benthin, Michael Kern, David McAllister

    We present a method for efficiently ray tracing large amounts of uniquely animated complex mesh-based geometry. A tetrahedral cage is used to split the original non-animated triangle geometry into disjoint sets of triangles. For each tetrahedron, an acceleration structure is built over its enclosed triangles, and a separate one over all tetrahedra. Instead of applying animation transformations to the actual triangular geometry, we apply them only to the tetrahedral cage and transform rays intersecting the animated tetrahedra. Only the acceleration structure over all tetrahedra needs to be rebuilt once per frame. The cost of animating geometry per frame depends solely on the resolution of the tetrahedral cage and is decoupled from the density of the original geometry. Our method targets animations that preserve triangle connectivity and approximates vertex motion by a piecewise-linear deformation induced by the tetrahedral cage. We demonstrate that our method outperforms competing animation approaches in both update time and memory consumption, enabling ray tracing of large amounts of animated complex geometry in real time on current generation GPUs.

  • Open Access

    Axis‐Normalized Ray‐Box Intersection

    by F. Friederichs, C. Benthin, S. Grogorick, E. Eisemann, M. Magnor, M. Eisemann

    Ray‐axis aligned bounding box intersection tests play a crucial role in the runtime performance of many rendering applications, driven not by complexity but mainly by the volume of tests required. While existing solutions were believed to be pretty much optimal in terms of runtime on current hardware, our paper introduces a new intersection test requiring fewer arithmetic operations compared to all previous methods. By transforming the ray we eliminate the need for one third of the traditional bounding‐slab tests and achieve a speed enhancement of approximately 13.8% or 10.9%, depending on the compiler. We present detailed runtime analyses in various scenarios.


  • Ray Tracing Animated Displaced Micro‐Meshes

    by Holger Gruen, Carsten Benthin, Andrew Kensler, Joshua Barczak, David McAllister

    We present a new method that allows efficient ray tracing of virtually artefact‐free animated displaced micro‐meshes (DMMs) [MMT23] and preserves their low memory footprint and low BVH build and update cost. DMMs allow for compact representation of micro‐triangle geometry through hierarchical encoding of displacements. Displacements are computed with respect to a coarse base mesh and are used to displace new vertices introduced during 1 : 4 subdivision of the base mesh. Applying non‐rigid transformation to the base mesh can result in silhouette and normal artefacts (see Figure 1) during animation. We propose an approach which prevents these artefacts by interpolating transformation matrices before applying them to the DMM representation. Our interpolation‐based algorithm does not change DMM data structures and it allows for efficient bounding of animated micro‐triangle geometry which is essential for fast tessellation‐free ray tracing of animated DMMs.


  • Open Access

    H-PLOC: Hierarchical Parallel Locally-Ordered Clustering for Bounding Volume Hierarchy Construction

    by Carsten Benthin, Daniel Meister, Joshua Barczak, Rohan Mehalwal, John Tsakok, Andrew Kensler

    We propose a novel GPU-oriented approach for constructing binary bounding volume hierarchies (BVHs) based on the parallel locally-ordered clustering (PLOC/PLOC++) algorithm. Compared to competing high-performance GPU BVH build algorithms (PLOC++ or ATRBVH), our method provides similar BVH quality in just a single kernel launch while achieving 1.1-3.6× lower construction times for the entire BVH build and 1.6-13× lower for just the binary BVH construction phase. Additionally, we propose an efficient algorithm to convert a binary BVH to an n-wide BVH with just a single kernel launch. Besides being extremely efficient, our proposed algorithms are simple to implement, allowing easy integration into existing frameworks.


  • Open Access

    DGF: A Dense, Hardware-Friendly Geometry Format for Lossily Compressing Meshlets with Arbitrary Topologies

    by Joshua Barczak, Carsten Benthin, David McAllister

    The widespread availability of hardware accelerated ray tracing solutions is driving a gradual sea-change in the real-time graphics space. The major graphics APIs now offer standardized support for accelerated ray tracing. In the same time frame, rasterization-based systems such as Nanite [Karis et al. 2021] have significantly raised geometric complexity in games. The state of the art in raster graphics now enables lossy compressed geometry representations that are decoded on the-fly during rendering. This trend conflicts with current ray tracing interfaces, which require opaque acceleration structures to be built from uncompressed input data. This paper seeks to close the gap by defining a block-compressed geometry format that is designed for arbitrary geometry topologies and can be directly consumed by future fixed-function hardware.


  • Stochastic Subsets for BVH Construction

    by L. Tessari, A. Dittebrand, M. J. Doyle, C. Benthin

    BVH construction is a critical component of real‐time and interactive ray‐tracing systems. However, BVH construction can be both compute and bandwidth intensive, especially when a large degree of dynamic geometry is present. Different build algorithms vary substantially in the traversal performance that they produce, making high quality construction algorithms desirable. However, high quality algorithms, such as top‐down construction, are typically more expensive, limiting their benefit in real‐time and interactive contexts. One particular challenge of high quality top‐down construction algorithms is that the large working set at the top of the tree can make constructing these levels bandwidth‐intensive, due to O(nlog(n)) complexity, limited cache locality, and less dense compute at these levels. To address this limitation, we propose a novel stochastic approach to GPU BVH construction that selects a representative subset to build the upper levels of the tree. As a second pass, the remaining primitives are clustered around the BVH leaves and further processed into a complete BVH. We show that our novel approach significantly reduces the construction time of top‐down GPU BVH builders by a factor up to 1.8×, while achieving competitive rendering performance in most cases, and exceeding the performance in others.


  • Open Access

    STBVH

    by Sven Woop, Attila T. Áfra, Carsten Benthin

    We present the STBVH, a new approach for rendering multi-segment motion blur using a bounding volume hierarchy (BVH) that stores both spatial linearly interpolated bounds and temporal bounds. The approach is designed for different number of time steps per mesh or object. While separating the individual meshes using standard partitioning techniques, it performs temporal splits for locations with large or curved motion inside the meshes. Our approach uses a modified motion blur surface area heuristic (MBSAH) that calculates probabilities in the presence of spatial-temporal bounds and works on linear motion segments of primitives rather than on full motion curves. We show that our approach is able to handle challenging scenes with varying degrees of motion blur per mesh, using significantly less memory and having competitive rendering performance compared to building separate linear motion blur BVHs per global time segment.