• Login
    View Item 
    •   Eurographics DL Home
    • Computer Graphics Forum
    • Volume 33 (2014)
    • 33-Issue 1
    • View Item
    •   Eurographics DL Home
    • Computer Graphics Forum
    • Volume 33 (2014)
    • 33-Issue 1
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Stackless Multi‐BVH Traversal for CPU, MIC and GPU Ray Tracing

    Thumbnail
    View/Open
    v33i1pp129-140.pdf (1.866Mb)
    Date
    2014
    Author
    Áfra, Attila T.
    Szirmay‐Kalos, László
    Pay-Per-View via TIB Hannover:

    Try if this item/paper is available.

    Metadata
    Show full item record
    Abstract
    Stackless traversal algorithms for ray tracing acceleration structures require significantly less storage per ray than ordinary stack‐based ones. This advantage is important for massively parallel rendering methods, where there are many rays in flight. On SIMD architectures, a commonly used acceleration structure is the MBVH, which has multiple bounding boxes per node for improved parallelism. It scales to branching factors higher than two, for which, however, only stack‐based traversal methods have been proposed so far. In this paper, we introduce a novel stackless traversal algorithm for MBVHs with up to four‐way branching. Our approach replaces the stack with a small bitmask, supports dynamic ordered traversal, and has a low computation overhead. We also present efficient implementation techniques for recent CPU, MIC (Intel Xeon Phi) and GPU (NVIDIA Kepler) architectures.Stackless traversal algorithms for ray tracing acceleration structures require significantly less storage per ray than ordinary stack‐based ones. This advantage is important for massively parallel rendering methods, where there are many rays in flight. On SIMD architectures, a commonly used acceleration structure is the multi bounding volume hierarchy (MBVH), which has multiple bounding boxes per node for improved parallelism. It scales to branching factors higher than two, for which, however, only stack‐based traversal methods have been proposed so far. In this paper, we introduce a novel stackless traversal algorithm for MBVHs with up to 4‐way branching.
    BibTeX
    @article {10.1111:cgf.12259,
    journal = {Computer Graphics Forum},
    title = {{Stackless Multi‐BVH Traversal for CPU, MIC and GPU Ray Tracing}},
    author = {Áfra, Attila T. and Szirmay‐Kalos, László},
    year = {2014},
    publisher = {The Eurographics Association and John Wiley and Sons Ltd.},
    ISSN = {1467-8659},
    DOI = {10.1111/cgf.12259}
    }
    URI
    http://dx.doi.org/10.1111/cgf.12259
    Collections
    • 33-Issue 1

    Eurographics Association copyright © 2013 - 2023 
    Send Feedback | Contact - Imprint | Data Privacy Policy | Disable Google Analytics
    Theme by @mire NV
    System hosted at  Graz University of Technology.
    TUGFhA
     

     

    Browse

    All of Eurographics DLCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Statistics

    View Usage Statistics

    BibTeX | TOC

    Create BibTeX Create Table of Contents

    Eurographics Association copyright © 2013 - 2023 
    Send Feedback | Contact - Imprint | Data Privacy Policy | Disable Google Analytics
    Theme by @mire NV
    System hosted at  Graz University of Technology.
    TUGFhA