PLOC++: Parallel Locally-Ordered Clustering for Bounding Volume Hierarchy Construction Revisited

IF 1.4 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Carsten Benthin, R. Drabinski, Lorenzo Tessari, Addis Dittebrandt
{"title":"PLOC++: Parallel Locally-Ordered Clustering for Bounding Volume Hierarchy Construction Revisited","authors":"Carsten Benthin, R. Drabinski, Lorenzo Tessari, Addis Dittebrandt","doi":"10.1145/3543867","DOIUrl":null,"url":null,"abstract":"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 × .","PeriodicalId":74536,"journal":{"name":"Proceedings of the ACM on computer graphics and interactive techniques","volume":"5 1","pages":"31:1-31:13"},"PeriodicalIF":1.4000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ACM on computer graphics and interactive techniques","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3543867","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 2

Abstract

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 × .
并行局部有序聚类在边界体层次结构中的应用
我们提出了一种新的面向gpu的大规模并行局部有序聚类(PLOC)算法,用于构建边界卷层次结构(BVHs)。我们的方法侧重于通过简化和融合不同阶段来消除原始方法的弱点,同时用新颖和更有效的算法替换大多数性能关键部分。这种组合可以使原始方法的性能高出1倍。9−2。3;
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
2.90
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信