Proceedings: GI 2016

Recursive SAH-based Bounding Volume Hierarchy Construction

Dominik Wodniok (TU Darmstadt), Michael Goesele (TU Darmstadt)

Proceedings of Graphics Interface 2016: Victoria, British Columbia, Canada, 1-3 June 2016, 101-107

DOI 10.20380/GI2016.13

  • Bibtex

    @inproceedings{Wodniok:2016:10.20380/GI2016.13,
    author = {Wodniok, Dominik and Goesele, Michael},
    title = {Recursive SAH-based Bounding Volume Hierarchy Construction},
    booktitle = {Proceedings of Graphics Interface 2016},
    series = {GI 2016},
    year = {2016},
    issn = {0713-5424},
    isbn = {978-0-9947868-1-4},
    location = {Victoria, British Columbia, Canada},
    pages = {101--107},
    numpages = {7},
    doi = {10.20380/GI2016.13},
    publisher = {Canadian Human-Computer Communications Society / Soci{\'e}t{\'e} canadienne du dialogue humain-machine},
    }

Abstract

Advances in research on quality metrics for bounding volume hierarchies (BVHs) have shown that greedy top-down SAH builders construct BVHs with superior traversal performance despite the fact that the resulting SAH values are higher than those created by more sophisticated builders. Motivated by this observation we examine a construction algorithm that uses recursive SAH values of temporarily constructed SAH-built BVHs to guide the construction. The resulting BVHs achieve up to 28% better trace performance for primary rays and up to 24% better trace performance for secondary diffuse rays compared to standard plane sweeping without applying spatial splits. Allowing spatial splits we still achieve up to 20% resp. 19% better performance. While our approach is not suitable for real-time BVH construction, we show that the proposed algorithm has subquadratic computational complexity in the number of primitives, which renders it usable in practical applications.