Carsten Benthin, R. Drabinski, Lorenzo Tessari, Addis Dittebrandt
{"title":"并行局部有序聚类在边界体层次结构中的应用","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":"{\"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}","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}
PLOC++: Parallel Locally-Ordered Clustering for Bounding Volume Hierarchy Construction Revisited
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 × .