PLOC++ : Parallel Locally-Ordered Clustering for Bounding Volume Hierarchy Construction Revisited
View/
Date
2022Pay-Per-View via TIB Hannover:
Try if this item/paper is available.
Metadata
Show full item recordAbstract
We propose a novel version of the GPU-oriented massively parallel locally-ordered clustering (PLOC) algorithm for constructing bounding volume hierarchies (BVHs). Our method focuses on removing the weaknesses of the original approach by simplifying and fusing different phases, while replacing most performance critical parts by novel and more efficient algorithms. This combination allows for outperforming the original approach by a factor of 1.9 - 2.3×.
BibTeX
@inproceedings {10.1145:3543867,
booktitle = {Proceedings of the ACM on Computer Graphics and Interactive Techniques},
editor = {Josef Spjut and Marc Stamminger and Victor Zordan},
title = {{PLOC++ : Parallel Locally-Ordered Clustering for Bounding Volume Hierarchy Construction Revisited}},
author = {Benthin, Carsten and Drabinski, Radoslaw and Tessari, Lorenzo and Dittebrandt, Addis},
year = {2022},
publisher = {ACM Association for Computing Machinery},
ISSN = {2577-6193},
DOI = {10.1145/3543867}
}
booktitle = {Proceedings of the ACM on Computer Graphics and Interactive Techniques},
editor = {Josef Spjut and Marc Stamminger and Victor Zordan},
title = {{PLOC++ : Parallel Locally-Ordered Clustering for Bounding Volume Hierarchy Construction Revisited}},
author = {Benthin, Carsten and Drabinski, Radoslaw and Tessari, Lorenzo and Dittebrandt, Addis},
year = {2022},
publisher = {ACM Association for Computing Machinery},
ISSN = {2577-6193},
DOI = {10.1145/3543867}
}