EGGH: SIGGRAPH/Eurographics Workshop on Graphics Hardware
Permanent URI for this community
Browse
Browsing EGGH: SIGGRAPH/Eurographics Workshop on Graphics Hardware by Author "Benthin, Carsten"
Now showing 1 - 5 of 5
Results Per Page
Sort Options
Item Compressed-Leaf Bounding Volume Hierarchies(ACM, 2018) Benthin, Carsten; Wald, Ingo; Woop, Sven; Áfra, Attila T.; Patney, Anjul and Niessner, MatthiasWe propose and evaluate what we call Compressed-Leaf Bounding Volume Hierarchies (CLBVH), which strike a balance between compressed and non-compressed BVH layouts. Our CLBVH layout introduces dedicated compressed multi-leaf nodes where most effective at reducing memory use, and uses regular BVH nodes for inner nodes and small, isolated leaves. We show that when implemented within the Embree ray tracing framework, this approach achieves roughly the same memory savings as Embree's compressed BVH layout, while maintaining almost the full performance of its fastest non-compressed BVH.Item PLOC++ : Parallel Locally-Ordered Clustering for Bounding Volume Hierarchy Construction Revisited(ACM Association for Computing Machinery, 2022) Benthin, Carsten; Drabinski, Radoslaw; Tessari, Lorenzo; Dittebrandt, Addis; Josef Spjut; Marc Stamminger; Victor ZordanWe propose a novel version of the GPU-oriented massively parallel locally-ordered clustering (PLOC) algorithm for constructing bounding volume hierarchies (BVHs). Our method focuses on removing the weaknesses of the original approach by simplifying and fusing different phases, while replacing most performance critical parts by novel and more efficient algorithms. This combination allows for outperforming the original approach by a factor of 1.9 - 2.3×.Item Real-Time Ray Tracing of Micro-Poly Geometry with Hierarchical Level of Detail(The Eurographics Association and John Wiley & Sons Ltd., 2023) Benthin, Carsten; Peters, Christoph; Bikker, Jacco; Gribble, ChristiaanIn recent work, Nanite has demonstrated how to rasterize virtualized micro-poly geometry in real time, thus enabling immense geometric complexity. We present a system that employs similar methods for real-time ray tracing of micro-poly geometry. The geometry is preprocessed in almost the same fashion: Nearby triangles are clustered together and clusters get merged and simplified to obtain hierarchical level of detail (LOD). Then these clusters are compressed and stored in a GPU-friendly data structure. At run time, Nanite selects relevant clusters, decompresses them and immediately rasterizes them. Instead of rasterization, we decompress each selected cluster into a small bounding volume hierarchy (BVH) in the format expected by the ray tracing hardware. Then we build a complete BVH on top of the bounding volumes of these clusters and use it for ray tracing. Our BVH build reaches more than 74% of the attainable peak memory bandwidth and thus it can be done per frame. Since LOD selection happens per frame at the granularity of clusters, all triangles cover a small area in screen space.Item Sub-triangle opacity masks for faster ray tracing of transparent objects(ACM, 2020) Gruen, Holger; Benthin, Carsten; Woop, Sven; Yuksel, Cem and Membarth, Richard and Zordan, VictorWe propose an easy and simple-to-integrate approach to accelerate ray tracing of alpha-tested transparent geometry with a focus on Microsoft® DirectX® or Vulkan® ray tracing extensions. Pre-computed bit masks are used to quickly determine fully transparent and fully opaque regions of triangles thereby skipping the more expensive alpha-test operation. These bit masks allow us to skip up to 86% of all transparency tests, yielding up to 40% speed up in a proof-of-concept DirectX® software only implementation.Item Wide BVH Traversal with a Short Stack(The Eurographics Association, 2019) Vaidyanathan, Karthik; Woop, Sven; Benthin, Carsten; Steinberger, Markus and Foley, TimCompressed wide bounding volume hierarchies can significantly improve the performance of incoherent ray traversal, through a smaller working set of inner nodes and therefore a higher cache hit rate. While inner nodes in the hierarchy can be compressed, the size of the working set for a full traversal stack remains a significant overhead. In this paper we introduce an algorithm for wide bounding volume hierarchy (BVH) traversal that uses a short stack of just a few entries. This stack can be fully stored in scarce on-chip memory, which is especially important for GPUs and dedicated ray tracing hardware implementations. Our approach in particular generalizes the restart trail algorithm for binary BVHs to BVHs of arbitrary widths. Applying our algorithm to wide BVHs, we demonstrate that the number of traversal steps with just five stack entries is close to that of a full traversal stack. We also propose an extension to efficiently cull leaf nodes when a closer intersection has been found, which reduces ray primitive intersections by up to 14%.