Now showing items 1-4 of 4

    • Compressed-Leaf Bounding Volume Hierarchies 

      Benthin, Carsten; Wald, Ingo; Woop, Sven; Áfra, Attila T. (ACM, 2018)
      We 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 ...
    • PLOC++ : Parallel Locally-Ordered Clustering for Bounding Volume Hierarchy Construction Revisited 

      Benthin, Carsten; Drabinski, Radoslaw; Tessari, Lorenzo; Dittebrandt, Addis (ACM Association for Computing Machinery, 2022)
      We 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 ...
    • Sub-triangle opacity masks for faster ray tracing of transparent objects 

      Gruen, Holger; Benthin, Carsten; Woop, Sven (ACM, 2020)
      We 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 ...
    • Wide BVH Traversal with a Short Stack 

      Vaidyanathan, Karthik; Woop, Sven; Benthin, Carsten (The Eurographics Association, 2019)
      Compressed 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 ...