Efficient Construction of Out-of-Core Octrees for Managing Large Point Sets
No Thumbnail Available
Date
2024
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association
Abstract
Among various space partitioning approaches for managing point sets out-of-core, octrees are commonly used for being simple and effective. An efficient and adaptive out-of-core octree construction method has been proposed by Kontkanen et al. [KTO11], generating the octree data in a single sweep over the points sorted in Morton order, for a given maximum point count m per octree leaf. Their method keeps m+1 points in memory during the process, which may become an issue for large m. We present an extension to their algorithm that requires a minimum of two points to be held in memory in addition to a limited sequence of integers, thus adapting their method for use cases with large m. Moreover, we do not compute Morton codes explicitly but rather perform both the sorting and the octree generation directly on the point data, supporting coordinates of any finite precision.
Description
@inproceedings{10.2312:pgv.20241131,
booktitle = {Eurographics Symposium on Parallel Graphics and Visualization},
editor = {Reina, Guido and Rizzi, Silvio},
title = {{Efficient Construction of Out-of-Core Octrees for Managing Large Point Sets}},
author = {Fischer, Jonathan and Rosenthal, Paul and Linsen, Lars},
year = {2024},
publisher = {The Eurographics Association},
ISSN = {1727-348X},
ISBN = {978-3-03868-243-1},
DOI = {10.2312/pgv.20241131}
}