Efficient Neighbourhood Search in 3D Point Clouds Through Space-Filling Curves and Linear Octrees
Preprint
- 9 April 2026
- preprint
- Published by Elsevier in SSRN Electronic Journal
Abstract
This work presents an efficient approach for neighbourhood searching in 3D point clouds by combining spatial reordering leveraging Space-Filling Curves (SFCs), 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 10x faster than existing solutions. Furthermore, 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 36x 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.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Texture-Guided Graph Transform Optimization for Point Cloud Attribute CompressionApplied Sciences, 2024
- Hilbert Space Filling Curve Based Scan-Order for Point Cloud Attribute CompressionIEEE Transactions on Image Processing, 2022
- Dictionary Compression in Point Cloud Data ManagementACM Transactions on Spatial Algorithms and Systems, 2019
- A Parallel N-Dimensional Space-Filling Curve Library and Its Application in Massive Point Cloud ManagementISPRS International Journal of Geo-Information, 2018
- Paris-Lille-3D: A large and high-quality ground-truth urban point cloud dataset for automatic segmentation and classificationThe International Journal of Robotics Research, 2018
- GOTHIC: Gravitational oct-tree code accelerated by hierarchical time step controllingNew Astronomy, 2017
- A class of fast algorithms for the Peano-Hilbert space-filling curve2002
- Space-filling curves and their use in the design of geometric data structuresTheoretical Computer Science, 1997