research-article

H-PLOC: Hierarchical Parallel Locally-Ordered Clustering for Bounding Volume Hierarchy Construction

Authors:

Carsten Benthin,

Daniel Meister,

Joshua Barczak,

Rohan Mehalwal,

Andrew KenslerAuthors Info & Claims

Proceedings of the ACM on Computer Graphics and Interactive Techniques, Volume 7, Issue 3

Article No.: 30, Pages 1 - 14

https://doi.org/10.1145/3675377

Published: 09 August 2024 Publication History

Abstract

We propose a novel GPU-oriented approach for constructing binary bounding volume hierarchies (BVHs) based on the parallel locally-ordered clustering (PLOC/PLOC++) algorithm. Compared to competing high-performance GPU BVH build algorithms (PLOC++ or ATRBVH), our method provides similar BVH quality in just a single kernel launch while achieving 1.1-3.6× lower construction times for the entire BVH build and 1.6-13× lower for just the binary BVH construction phase. Additionally, we propose an efficient algorithm to convert a binary BVH to an n-wide BVH with just a single kernel launch. Besides being extremely efficient, our proposed algorithms are simple to implement, allowing easy integration into existing frameworks.

References

[1]

Andy Adinets and Duane Merrill. 2022. Onesweep: A Faster Least Significant Digit Radix Sort for GPUs. (2022). https://arxiv.org/abs/2206.01784

[2]

Ciprian Apetrei. 2014. Fast and Simple Agglomerative LBVH Construction. In Proceedings of Computer Graphics and Visual Computing.

[3]

Carsten Benthin. 2023. PLOC++ Implementation. https://github.com/embree/embree/tree/ploc

[4]

Carsten Benthin, Radoslaw Drabinski, Lorenzo Tessari, and Addis Dittebrandt. 2022. PLOC++: Parallel Locally-Ordered Clustering for Bounding Volume Hierarchy Construction Revisited. Proc. ACM Comput. Graph. Interact. Tech. 5, 3, Article 31 (2022).

Digital Library

[5]

Leonardo Domingues and Hélio Pedrini. 2015. Bounding Volume Hierarchy Optimization through Agglomerative Treelet Restructuring. In Proceedings of High-Performance Graphics. 13--20.

Digital Library

[6]

Jeffrey Goldsmith and John Salmon. 1987. Automatic Creation of Object Hierarchies for Ray Tracing. Computer Graphics and Applications 7, 5 (1987), 14--20.

Digital Library

[7]

Yan Gu, Yong He, Kayvon Fatahalian, and Guy Blelloch. 2013. Efficient BVH Construction via Approximate Agglomerative Clustering. In Proceedings of High-Performance Graphics. 81--88.

Digital Library

[8]

Warren Hunt, William Mark, and Don Fussell. 2007. Fast and Lazy Build of Acceleration Structures from Scene Hierarchies. In Proceedings of Symposium on Interactive Ray Tracing. 47--54.

Digital Library

[9]

Tero Karras. 2012. Maximizing Parallelism in the Construction of BVHs, Octrees, and k-d Trees. In Proceedings of High-Performance Graphics. 33--37.

[10]

Tero Karras and Timo Aila. 2013. Fast Parallel Construction of High-Quality Bounding Volume Hierarchies. In Proceedings of High-Performance Graphics. 89--100.

Digital Library

[11]

Christian Lauterbach, Michael Garland, Shubhabrata Sengupta, David Luebke, and Dinesh Manocha. 2009. Fast BVH Construction on GPUs. Computer Graphics Forum 28, 2 (2009), 375--384.

[12]

Daniel Meister and Jiří Bittner. 2018a. Parallel Locally-Ordered Clustering for Bounding Volume Hierarchy Construction. IEEE Transactions on Visualization and Computer Graphics 24, 3 (2018), 1345--1353.

[13]

Daniel Meister and Jiří Bittner. 2018b. Parallel Reinsertion for Bounding Volume Hierarchy Optimization. Computer Graphics Forum (Proceedings of Eurographics) 37, 2 (2018), 463--473.

[14]

Daniel Meister and Jiri Bittner. 2022. Performance Comparison of Bounding Volume Hierarchies for GPU Ray Tracing. Journal of Computer Graphics Techniques (2022).

[15]

Daniel Meister, Shinji Ogaki, Carsten Benthin, Michael J. Doyle, Michael Guthe, and Jirí Bittner. 2021. A Survey on Bounding Volume Hierarchies for Ray Tracing. Computer Graphics Forum (2021).

[16]

Microsoft. 2020. DirectX Raytracing (DXR) Functional Spec. https://microsoft.github.io/DirectX-Specs/d3d/Raytracing.html

[17]

John Nickolls, Ian Buck, Michael Garland, and Kevin Skadron. 2008. Scalable Parallel Programming with CUDA. Queue 6, 2 (2008), 40--53.

Digital Library

[18]

André Susano Pinto. 2010. Adaptive Collapsing on Bounding Volume Hierarchies for Ray-Tracing. In Proceedings of Eurographics (Short Papers).

[19]

Timo Viitanen, Matias Koskela, Pekka Jääskeläinen, Aleksi Tervo, and Jarmo Takala. 2018. PLOCTree: A Fast, High-Quality Hardware BVH Builder. Proceedings of the ACM on Computer Graphics and Interactive Techniques 1, 2 (2018).

Digital Library

[20]

Marek Vinkler, Jiří Bittner, and Vlastimil Havran. 2017. Extended Morton Codes for High Performance Bounding Volume Hierarchy Construction. In Proceedings of High-Performance Graphics.

Digital Library

[21]

Ingo Wald, Carsten Benthin, and Solomon Boulos. 2008. Getting Rid of Packets - Efficient SIMD Single-Ray Traversal using Multi-Branching BVHs. In Symposium on Interactive Ray Tracing. 49--57.

[22]

Bruce Walter, Kavita Bala, Milind Kulkarni, and Keshav Pingali. 2008. Fast Agglomerative Clustering for Rendering. In Proceedings of Symposium on Interactive Ray Tracing. 81--86.

[23]

Henri Ylitie, Tero Karras, and Samuli Laine. 2017. Efficient Incoherent Ray Traversal on GPUs Through Compressed Wide BVHs. In High-Performance Graphics. 4:1--4:13.

Cited By

Cassell TDeakin TAlpay AHeuveline VGadeschi G(2024)Efficient Tree-based Parallel Algorithms for N-Body Simulations Using C++ Standard ParallelismProceedings of the SC '24 Workshops of the International Conference on High Performance Computing, Network, Storage, and Analysis10.1109/SCW63240.2024.00099(708-717)Online publication date: 17-Nov-2024
https://dl.acm.org/doi/10.1109/SCW63240.2024.00099

Index Terms

H-PLOC: Hierarchical Parallel Locally-Ordered Clustering for Bounding Volume Hierarchy Construction
1. Computing methodologies
  1. Computer graphics
    1. Rendering
      1. Ray tracing
2. Theory of computation
  1. Design and analysis of algorithms
    1. Data structures design and analysis
      1. Sorting and searching
    2. Parallel algorithms
      1. Massively parallel algorithms

Recommendations

GPU Ray Tracing Based on Reduced Bounding Volume Hierarchies
CGIV '12: Proceedings of the 2012 Ninth International Conference on Computer Graphics, Imaging and Visualization

We present a bounding volume hierarchy construction based on a culling technique for performing ray tracing on manycore GPUs. The objects are divided into view-sets of triangles with respect to a set of view targets (including the camera and the light ...
Ray Specialized Contraction on Bounding Volume Hierarchies

In this paper we propose a simple but effective method to modify a BVH based on ray distribution for improved ray tracing performance. Our method starts with an initial BVH generated by any state-of-the-art offline algorithm. Then by traversing a small ...
Grid-based SAH BVH construction on a GPU
CGI'2011 Conference

We present an efficient algorithm for building an adaptive bounding volume hierarchy (BVH) in linear time on commodity graphics hardware using CUDA. BVHs are widely used as an acceleration data structure to quickly ray trace animated polygonal scenes. ...

Comments

Information & Contributors

Information

Published In

cover image Proceedings of the ACM on Computer Graphics and Interactive Techniques

Proceedings of the ACM on Computer Graphics and Interactive Techniques Volume 7, Issue 3

August 2024

363 pages

EISSN:2577-6193

DOI:10.1145/3688389

Issue’s Table of Contents

Copyright © 2024 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 August 2024

Published in PACMCGIT Volume 7, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Badges

Best Paper

Author Tags

Qualifiers

Research-article
Research
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
164
Total Downloads

Downloads (Last 12 months)164
Downloads (Last 6 weeks)14

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Cassell TDeakin TAlpay AHeuveline VGadeschi G(2024)Efficient Tree-based Parallel Algorithms for N-Body Simulations Using C++ Standard ParallelismProceedings of the SC '24 Workshops of the International Conference on High Performance Computing, Network, Storage, and Analysis10.1109/SCW63240.2024.00099(708-717)Online publication date: 17-Nov-2024
https://dl.acm.org/doi/10.1109/SCW63240.2024.00099

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents