A Hybrid Spatial Indexing Structure of Massive Point Cloud Based on Octree and 3D R*-Tree

The spatial index structure is one of the most important research topics for organizing and managing massive 3D Point Cloud. As a point in Point Cloud consists of Cartesian coordinates (x,y,z), the common method to explore geometric information and features is nearest neighbor searching. An efficient spatial indexing structure directly affects the speed of the nearest neighbor search. Octree and kd-tree are the most used for Point Cloud data. However, octree or KD-tree do not perform best in nearest neighbor searching. A highly balanced tree, 3D R*-tree is considered the most effective method so far. So, a hybrid spatial indexing structure is proposed based on octree and 3D R*-tree. In this paper, we discussed how thresholds influence the performance of nearest neighbor searching and constructing the tree. Finally, an adaptive way method adopted to set thresholds. Furthermore, we obtained a better performance in tree construction and nearest neighbor searching than octree and 3D R*-tree.

[1]  J. T. Robinson,et al.  The K-D-B-tree: a search structure for large multidimensional dynamic indexes , 1981, SIGMOD '81.

[2]  Chris L. Jackins,et al.  Oct-trees and their use in representing three-dimensional objects , 1980 .

[3]  João Ascenso,et al.  Hybrid Octree-Plane Point Cloud Geometry Coding , 2019, 2019 27th European Signal Processing Conference (EUSIPCO).

[4]  Charles M. Eastman.  Representations for space planning , 1970, CACM.

[5]  Oualid Doukhi,et al.  Transfer Learning Based Semantic Segmentation for 3D Object Detection from Point Cloud , 2021, Sensors.

[6]  Dieter Pfoser,et al.  Revisiting R-Tree Construction Principles , 2002, ADBIS.

[7]  Shi-Nine Yang,et al.  A new linear octree construction by filling algorithms , 1991, [1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications.

[8]  P. Besl.  Geometric modeling and computer vision , 1988, Proc. IEEE.

[9]  Hong Gu,et al.  OctreeNet: A Novel Sparse 3-D Convolutional Neural Network for Real-Time 3-D Outdoor Scene Analysis , 2020, IEEE Transactions on Automation Science and Engineering.

[10]  Bin Lu,et al.  Massive Point Cloud Space Management Method Based on Octree-Like Encoding , 2019, Arabian Journal for Science and Engineering.

[11]  Yuxiang Sun,et al.  A Hybrid Approach Combining R*-Tree and k-d Trees to Improve Linked Open Data Query Performance , 2021, Applied Sciences.

[12]  Kuo-Liang Chung,et al.  Manipulation Images by Using Run-Length Morton Codes , 1997, Int. J. Pattern Recognit. Artif. Intell..

[13]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[14]  Leonidas J. Guibas,et al.  PointNet: Deep Learning on Point Sets for 3D Classification and Segmentation , 2016, 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

[15]  G. M. Hunter,et al.  Linear transformation of pictures represented by quad trees , 1979 .

[16]  Qican Zhang,et al.  3-D shape measurement based on complementary Gray-code light , 2012 .

[17]  Jon Louis Bentley,et al.  Quad trees a data structure for retrieval on composite keys , 1974, Acta Informatica.

[18]  João Ascenso,et al.  Rate-Distortion Driven Adaptive Partitioning for Octree-Based Point Cloud Geometry Coding , 2018, 2018 25th IEEE International Conference on Image Processing (ICIP).

[19]  Neill D. F. Campbell,et al.  A Comparative Study about Data Structures Used for Efficient Management of Voxelised Full-Waveform Airborne LiDAR Data during 3D Polygonal Model Creation , 2021, Remote. Sens..

[20]  Fabrice Jaillet,et al.  Fast Quadtree/Octree adaptive meshing and re-meshing with linear mixed elements , 2021, Engineering with Computers.

[21]  Nick Roussopoulos,et al.  Nearest neighbor queries , 1995, SIGMOD '95.

[22]  Chen Maolin,et al.  A Method of Organizing Point Clouds Based on Linear KD Tree , 2016 .

[23]  Michael Gervautz,et al.  R-trees for organizing and visualizing 3D GIS databases , 2000 .

[24]  Gary D. Knott.  A balanced tree storage and retrieval algorithm , 1971, SIGIR '71.

[25]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[26]  Zhao Gang,et al.  Research on spatial index structure of massive point clouds based on hybrid tree , 2017, 2017 IEEE 2nd International Conference on Big Data Analysis (ICBDA)(.

[27]  M. Baes,et al.  Hierarchical octree and k-d tree grids for 3D radiative transfer simulations , 2013, 1311.0705.

[28]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[29]  Hui Zhao,et al.  Database-oriented storage based on LMDB and linear octree for massive block model , 2016 .

[30]  Yongzhi Wang,et al.  Geological tetrahedral model-oriented hybrid spatial indexing structure based on Octree and 3D R*-tree , 2020, Arabian Journal of Geosciences.