Pablo D. Viñambres
Pablo D. Viñambres has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Francisco Fernandez Rivera
Centro Singular de Investigación en Tecnoloxías Intelixentes (CiTIUS), University of Santiago de Compostela, 15782 Santiago de Compostela, Spain
1 shared publication - Jose Carlos Cabaleiro
Centro Singular de Investigación en Tecnoloxías Intelixentes (CiTIUS), Dpto. Electrónica e Computación, Universidade de Santiago de Compostela, Santiago de Compostela, Spain
1 shared publication - Miguel Yermo
Centro Singular de Investigación en Tecnoloxías Intelixentes (CiTIUS) Universidad de Santiago de Compostela Rúa de Jenaro de la Fuente Domínguez Santiago de Compostela 15782 Galicia Spain
1 shared publication - Oscar García Lorenzo
University of Santiago de Compostela
1 shared publication - Silvia R. Alcaraz
ETH Zurich, Zurich, Switzerland
1 shared publication
Latest Publications
- Open Access
- 9 April 2026
- Published by Elsevier in SSRN Electronic Journal
Efficient Neighbourhood Search in 3D Point Clouds Through Space-Filling Curves and Linear Octrees
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.
- 9 April 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessEfficient Neighbourhood Search in 3D Point Clouds Through Space-Filling Curves and Linear Octrees
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.