散乱点云线性八叉树结构在GPU中的实现

摘要

为快速建立散乱点云的空间邻接关系,研究了更快速构建线性八叉树.采用Morton码描述八叉树的节点,并按照层次顺序对叶节点进行遍历,通过建立两个查询表,实现对节点相邻信息的快速查询.算法利用了GPU架构的并行度,实验表明,该算法有较高的效率.%In this paper a kind of linear GPU octree is proposed to establish scattered point cloud space adjacent relation fastly.The linear GPU octree uses Morton code for descripting octree node.Moreover,the leaf node are traversed with the hierarchy sequence and two luts are established to query adjacent nodes quickly.The algorithm makes full use of parallelism of GPU structure,which experiments show that,the new algorithm has higher efficiency.