Parallel Axis Split Tasks for Bounding Volume Construction with OpenMP
GRAPP, February 2025
Abstract
Many algorithms in computer graphics make use of acceleration structures such as Bounding Volume Hierarchies (BVHs) to speed up performance critical tasks, such as collision detection or ray-tracing. However, while the typical algorithms for constructing BVHs are relatively simple, actually implementing them for performance critical systems is still challenging. Further, to construct them as quickly as possible, it is also desirable to parallelize the process. To that end, parallelization APIs such as OpenMP® can be leveraged to greatly simplify this matter. However, BVH construction is not a trivially parallelizable problem. Thus, in this paper we propose a method of using OpenMP® tasking to further parallelize the spatial splitting algorithm and thus improve construction performance. We evaluate the proposed way and compare it with other ways of using OpenMP®, finding that some of these work well to improve the construction time by between 3 and 5 times on an 8-core machine with a minimal amount of work and negligible quality reduction of the final BVH.
Downloads and Links
- DOI - https://doi.org/10.5220/0013317100003912
- PDF - Authors' version of the paper
- PDF - GRAPP Poster
BibTeX entry
@conference{WaldemarsonGRAPP25,
author = {Gustaf Waldemarson and Michael Doggett},
title = {Parallel Axis Split Tasks for Bounding Volume Construction
with OpenMP},
booktitle = {Proceedings of the 20th International Joint Conference on
Computer Vision, Imaging and Computer Graphics Theory and
Applications - GRAPP},
year = {2025},
pages = {347-354},
publisher = {SciTePress},
organization = {INSTICC},
doi = {10.5220/0013317100003912},
isbn = {978-989-758-728-3},
issn = {2184-4321},
}