[1] 杨建思. 一种四叉树与KD树结合的海量机载LiDAR数据组织管理方法[J].武汉大学学报(信息科学版), 2014,39(8):918-922. [2] 赖祖龙, 万幼川,申邵洪,等.基于Hilbert排列码与R树的海量LIDAR点云索引[J].测绘科学, 2009, 34(6):128-130. [3] BENTLEY J L. Multidimensional Binary Search Trees Used for Associative Searching[J]. Communications of the ACM, 1975, 18(9):509-517. [4] NENE S A, NAYAR S K. A Simple Algorithm for Nearest Neighbor Search in High Dimensions[J]. IEEE Pattern Analysis and Machine Intelligence, 1997, 19(9):989-1003. [5] GREENSPAN M, YURICK M. Approximate KD Tree Search for Efficient ICP[C]//Proceedings of Fourth International Conference on 3-D Digital Imaging and Modeling.[S.l.]:IEEE, 2003:442-448. [6] HORN D R, SUGERMAN J, HOUSTON M, et al. Interactive KD Tree GPU Raytracing[C]//Proceedings of the 2007 Symposium on Interactive 3D Graphics and Games.[S.l.]:ACM, 2007:167-174. [7] 蔡志敏, 王晏民, 黄明.基于KD树散乱点云数据的Guass平均曲率精简算法[J]. 测绘通报, 2013(S1):44-46. [8] 张毅, 刘旭敏, 隋颖, 等.基于K-近邻点云去噪算法的研究与改进[J].计算机应用, 2009, 29(4):1011-1014. [9] 龚健雅.一种基于自然数的线性四叉树编码[J].测绘学报, 1992, 21(2):90-99. [10] 肖乐斌, 龚建华, 谢传节. 线性四叉树和线性八叉树邻域寻找的一种新算法[J].测绘学报,1998,27(3):195-203. [11] HOARE C A R.Quicksort[J]. The Computer Journal, 1962, 5(1):10-16. [12] ARYA S, MOUNT D M, NETANYAHU N S, et al. An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions[J].Journal of the ACM (JACM), 1998, 45(6):891-923. |