Truncated octree and its applications

Abstract

Octree is a hierarchical data structure with many applications, especially in encoding unstructured point clouds. The depth of an octree is dependent of the scale of the input data and the desired resolution of the smallest voxels in the leaf nodes as well. Thus, it often requires a deep octree to maintain low level of geometric errors for large-scale sparse point clouds, which leads to high memory requirement and low access speed. This paper presents a new structure called truncated octree or T-Octree that truncates the octree by adaptively pruning the top hierarchy and represents the deep octree by a set of shallow sub-octrees. The structure is further extended to support random access of nodes and out-of-core streaming of large data sets. We also propose a variable length addressing scheme to adaptively choose the length of an octree’s node address based on the truncation level. As a result, T-Octree provides highly efficient query performance and can save storage without losing the original structure for sparse or clustered models and scenes. We demonstrate the efficacy and efficiency of the new structure on point cloud compression and scene query tasks for sparse or clustered data.