Fast Out-of-Core Octree Generation for Massive Point Clouds
| dc.contributor.author | Schütz, Markus | en_US |
| dc.contributor.author | Ohrhallinger, Stefan | en_US |
| dc.contributor.author | Wimmer, Michael | en_US |
| dc.contributor.editor | Eisemann, Elmar and Jacobson, Alec and Zhang, Fang-Lue | en_US |
| dc.date.accessioned | 2020-10-29T18:50:15Z | |
| dc.date.available | 2020-10-29T18:50:15Z | |
| dc.date.issued | 2020 | |
| dc.description.abstract | We propose an efficient out-of-core octree generation method for arbitrarily large point clouds. It utilizes a hierarchical counting sort to quickly split the point cloud into small chunks, which are then processed in parallel. Levels of detail are generated by subsampling the full data set bottom up using one of multiple exchangeable sampling strategies.We introduce a fast hierarchical approximate blue-noise strategy and compare it to a uniform random sampling strategy. The throughput, including out-of-core access to disk, generating the octree, and writing the final result to disk, is about an order of magnitude faster than the state of the art, and reaches up to around 6 million points per second for the blue-noise approach and up to around 9 million points per second for the uniform random approach on modern SSDs. | en_US |
| dc.description.number | 7 | |
| dc.description.sectionheaders | Rendering | |
| dc.description.seriesinformation | Computer Graphics Forum | |
| dc.description.volume | 39 | |
| dc.identifier.doi | 10.1111/cgf.14134 | |
| dc.identifier.issn | 1467-8659 | |
| dc.identifier.pages | 155-167 | |
| dc.identifier.uri | https://doi.org/10.1111/cgf.14134 | |
| dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf14134 | |
| dc.publisher | The Eurographics Association and John Wiley & Sons Ltd. | en_US |
| dc.title | Fast Out-of-Core Octree Generation for Massive Point Clouds | en_US |