arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.06771cs.CG
收藏

通过空间填充曲线和线性八叉树实现3D点云中的高效邻域搜索

Efficient Neighbourhood Search in 3D Point Clouds Through Space-Filling Curves and Linear Octrees

Centro de Investigación en Tecnoloxías Intelixentes (CiTIUS)(智能技术研究中心);Universidade de Santiago de Compostela(圣地亚哥-德孔波斯特拉大学);ETH Zurich(苏黎世联邦理工学院)

Pablo D. Viñambres, Miguel Yermo, Silvia R. Alcaraz, Oscar G. Lorenzo, Francisco F. Rivera, José C. Cabaleiro

AI总结:

结合空间填充曲线(Morton和Hilbert曲线)与线性八叉树,提出固定半径和kNN搜索算法,并引入kNN局部性直方图,实验表明缓存缺失减少25%-75%,运行时间降低50%,搜索速度比现有方案快10倍。

摘要:

本文提出了一种高效的3D点云邻域搜索方法,通过结合利用空间填充曲线(SFC,特别是Morton和Hilbert曲线)进行空间重排序与线性八叉树实现。我们还提出了基于线性八叉树结构的固定半径和kNN查询专用搜索算法。此外,我们引入了kNN局部性直方图的新概念,该直方图易于计算以表征数据访问的局部性,并发现其与缓存缺失和搜索性能直接相关。实验表明,SFC重排序显著改善了空间数据的访问,将缓存缺失次数减少了25%至75%,运行时间降低了高达50%。此外,我们将我们的方案与几种广泛使用的八叉树和KD树实现进行了比较。我们的方法实现了搜索时间的显著减少,比现有解决方案快10倍。我们还分析了邻域搜索(使用OpenMP并行化)的性能,展示了其随核心数和问题规模的高度可扩展性。值得注意的是,在40核系统上执行固定半径搜索时,我们观察到了高达36倍的加速。结果表明,我们的方法为需要快速访问大规模3D点邻域集的应用提供了鲁棒且高效的解决方案。

英文摘要:

This work presents an efficient approach for neighbourhood searching in 3D point clouds by combining spatial reordering leveraging Space-Filling Curves (SFC), specifically Morton and Hilbert curves, with a linear Octree implementation. We also propose specialised search algorithms for fixed-radius and kNN queries, based on our linear Octree structures. Additionally, we introduce the novel concept of kNN locality histogram, which can be easily computed to characterise locality in data accesses, and we found to be directly related to cache misses and search performance. Our experiments reveal that SFC reordering significantly improves access to spatial data, reducing the number of cache misses from 25% to 75% and runtime by up to 50%. Moreover, we compare our proposal with several widely used Octree and KDTree implementations. Our method achieves a significant reduction in search time, up to 10$\times$ faster than existing solutions. Additionally, we analysed the performance of our neighbourhood searches (parallelised using OpenMP), demonstrating high scalability with the number of cores and the problem size. Notably, we observed a speedup of up to $36\times$ when executing fixed-radius searches in a system with 40 cores. The results obtained indicate that our methods provide a robust and efficient solution for applications that require fast access to large-scale 3D point neighbour sets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑