An Efficient Point Cloud Management Method Based on a 3D R-Tree

2012 ◽  
Vol 78 (4) ◽  
pp. 373-381 ◽  
Author(s):  
Jun Gong ◽  
Qing Zhu ◽  
Ruofei Zhong ◽  
Yeting Zhang ◽  
Xiao Xie
2018 ◽  
Vol 7 (8) ◽  
pp. 327 ◽  
Author(s):  
Xuefeng Guan ◽  
Peter van Oosterom ◽  
Bo Cheng

Because of their locality preservation properties, Space-Filling Curves (SFC) have been widely used in massive point dataset management. However, the completeness, universality, and scalability of current SFC implementations are still not well resolved. To address this problem, a generic n-dimensional (nD) SFC library is proposed and validated in massive multiscale nD points management. The library supports two well-known types of SFCs (Morton and Hilbert) with an object-oriented design, and provides common interfaces for encoding, decoding, and nD box query. Parallel implementation permits effective exploitation of underlying multicore resources. During massive point cloud management, all xyz points are attached an additional random level of detail (LOD) value l. A unique 4D SFC key is generated from each xyzl with this library, and then only the keys are stored as flat records in an Oracle Index Organized Table (IOT). The key-only schema benefits both data compression and multiscale clustering. Experiments show that the proposed nD SFC library provides complete functions and robust scalability for massive points management. When loading 23 billion Light Detection and Ranging (LiDAR) points into an Oracle database, the parallel mode takes about 10 h and the loading speed is estimated four times faster than sequential loading. Furthermore, 4D queries using the Hilbert keys take about 1~5 s and scale well with the dataset size.


2021 ◽  
Author(s):  
Zhenqi Wei ◽  
Fei Wang ◽  
Jiaqi Fan ◽  
Bingzhao Gao

Author(s):  
Liu Yang ◽  
Keping Yu ◽  
Simon Xianyi Yang ◽  
Chinmay Chakraborty ◽  
Yinzhi Lu ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document