Now showing items 1-5 of 5

    • Bounding Volume Hierarchy Optimization through Agglomerative Treelet Restructuring 

      Domingues, Leonardo R.; Pedrini, Helio (ACM Siggraph, 2015)
      In this paper, we present a new method for building high-quality bounding volume hierarchies (BVHs) on manycore systems. Our method is an extension of the current state-of-the-art on GPU BVH construction, Treelet Restructuring ...
    • Efficient Incoherent Ray Traversal on GPUs Through Compressed Wide BVHs 

      Ylitie, Henri; Karras, Tero; Laine, Samuli (ACM, 2017)
      We present a GPU-based ray traversal algorithm that operates on compressed wide BVHs and maintains the traversal stack in a compressed format. Our method reduces the amount of memory traffic significantly, which translates ...
    • Hardware-Accelerated Dual-Split Trees 

      Lin, Daqi; Vasiou, Elena; Yuksel, Cem; Kopta, Daniel; Brunvand, Erik (ACM, 2020)
      Bounding volume hierarchies (BVH) are the most widely used acceleration structures for ray tracing due to their high construction and traversal performance. However, the bounding planes shared between parent and children ...
    • On Quality Metrics of Bounding Volume Hierarchies 

      Aila, Timo; Karras, Tero; Laine, Samuli (ACM, 2013)
      The surface area heuristic (SAH) is widely used as a predictor for ray tracing performance, and as a heuristic to guide the construction of spatial acceleration structures. We investigate how well SAH actually predicts ray ...
    • Optimizing LBVH‐Construction and Hierarchy‐Traversal to accelerate kNN Queries on Point Clouds using the GPU 

      Jakob, J.; Guthe, M. (© 2021 Eurographics ‐ The European Association for Computer Graphics and John Wiley & Sons Ltd, 2021)
      Processing point clouds often requires information about the point neighbourhood in order to extract, calculate and determine characteristics. We continue the tradition of developing increasingly faster neighbourhood query ...