Parallel Axis Split Tasks for Bounding Volume Construction with OpenMP®
Waldemarson, Gustaf LU
and Doggett, Michael
LU
(2025)
20th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications, VISIGRAPP 2025
1.
p.347-354
- 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... (More)
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.
(Less)
- author
- Waldemarson, Gustaf
LU
and Doggett, Michael
LU
- organization
- publishing date
- 2025
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- keywords
- Bounding Volume Hierarchy, OpenMP, Parallelization, Ray-Tracing
- host publication
- Proceedings of the International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications
- volume
- 1
- pages
- 8 pages
- publisher
- Science and Technology Publications, Lda
- conference name
- 20th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications, VISIGRAPP 2025
- conference location
- Porto, Portugal
- conference dates
- 2025-02-26 - 2025-02-28
- external identifiers
-
- scopus:105001974530
- DOI
- 10.5220/0013317100003912
- language
- English
- LU publication?
- yes
- additional info
- Publisher Copyright: © 2025 by SCITEPRESS–Science and Technology Publications, Lda.
- id
- e5cd33e6-5fbd-41fc-86ec-4cbc84c75aa2
- date added to LUP
- 2025-09-01 13:08:07
- date last changed
- 2025-09-01 13:08:52
@inproceedings{e5cd33e6-5fbd-41fc-86ec-4cbc84c75aa2,
abstract = {{<p>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<sup>®</sup> 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<sup>®</sup> 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<sup>®</sup>, 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.</p>}},
author = {{Waldemarson, Gustaf and Doggett, Michael}},
booktitle = {{Proceedings of the International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications}},
keywords = {{Bounding Volume Hierarchy; OpenMP; Parallelization; Ray-Tracing}},
language = {{eng}},
pages = {{347--354}},
publisher = {{Science and Technology Publications, Lda}},
title = {{Parallel Axis Split Tasks for Bounding Volume Construction with OpenMP<sup>®</sup>}},
url = {{http://dx.doi.org/10.5220/0013317100003912}},
doi = {{10.5220/0013317100003912}},
volume = {{1}},
year = {{2025}},
}