A Hilbert code and R-tree organizing method for large point clouds from LiDAR
Lai Zu-long · Cehui kexue · 2009
Aiming at large point-clouds data,a novel 2-level index structure was proposed based on Hilbert code and R-tree.Hilbert space-filling curve was introduced to cluster LiDAR data point group and data volume of each group was controlled under the desired size,which improve the spatial cluster grouping and R-tree insertion algorithms,and therefore evidently reduce the overlap of R-tree sibling nodes and even the size of nodes.Using real data for test,the new method is proved having superior performances in several aspects.