[1]
|
Zhou Rurong, Zhang Liyan, Su Xu, et al. Algorithmic Research on Surface Reconstruction from Dense Scattered Points[J]. Journal of Software, 2001, 12(2):249-255(周儒荣, 张丽艳, 苏旭, 等. 海量散乱点的曲面重建算法研究[J]. 软件学报, 2001, 12(2):249-255) |
[2]
|
Cheng Xiaojun, He Guizhen. The Method and Application of Hole Boundary Extraction for Multi-valued Surface Repair[J]. Acta Geodaetica et Cartographica Sinica, 2012, 41(6):831-837(程效军, 何桂珍. 适用于多值曲面修复的空洞边界提取方法及应用[J]. 测绘学报, 2012, 41(6):831-837) |
[3]
|
Xiong Bangshu, He Mingyi, Yu Huajing. Algorithm for Finding k-nearest Neighbors of Scattered Points in Three Dimensions[J]. Journal of Computer-Aided Design and Computer Graphics, 2004, 16(7):909-912(熊邦书, 何明一, 余华璟. 三维散乱数据的k个最近邻域快速搜索算法[J]. 计算机辅助设计与图形图像学报, 2004, 16(7):909-912) |
[4]
|
Piegl L A, Tiller W. Algorithm for Finding All k Nearest Neighbors[J]. Computer-Aided Design, 2002, 34(2):167-172 |
[5]
|
Zhao Jianhui, Long Chengjiang, Ding Yihua, et al. A New k-nearest Neighbors Search Algorithm Based on 3D Cell Grids[J]. Geomatics and Information Science of Wuhan University, 2009, 34(5):615-618(赵俭辉, 龙成江, 丁乙华, 等. 一种基于立方体小栅格的k邻域快速搜索算法[J]. 武汉大学学报\5信息科学版, 2009, 34(5):615-618) |
[6]
|
Ma Juan, Fang Yuanming, Zhao Wenliang, et al. Algorithm for Finding k-nearest Neighbors Based on Spatial Sub-cubes and Dynamic Sphere[J]. Geomatics and Information Science of Wuhan University, 2011, 36(3):358-362(马娟, 方源敏, 赵文亮, 等. 利用空间微分块与动态球策略的k邻域搜索算法研究[J]. 武汉大学学报\5信息科学版, 2011, 36(3):358-362) |
[7]
|
Liu Yuehua, Liao Wenhe, Liu Hao. Research of k-nearest Neighbors Search Algorithm in Reverse Engineering[J]. Machinery Design and Manufacture, 2012, 1(3):256-258(刘越华, 廖文和, 刘浩. 逆向工程中散乱点云的k邻域搜索算法研究[J]. 机械设计与制造, 2012, 1(3):256-258) |
[8]
|
Sarkar M, Leong T Y. Application of k-nearest Neighbors Algorithm on Breast Cancer Diagnosis Problem[C]. The 2000 AMIA Annual Symposium, Los Angeles, CA, 2000 |
[9]
|
Connor M, Kumar P. Fast Construction of k-nearest Neighbor Graphs for Point Clouds[J]. IEEE Transactions on Visualization & Computer Graphics, 2010, 16(4):599-608 |
[10]
|
Sankaranarayanan J, Samet H, Varshney A. A Fast All Nearest Neighbor Algorithm for Applications Involving Large Point-Clouds[J]. Computers & Graph, 2007, 31(2):157-174 |
[11]
|
Procpiuc O, Agarwal P K, Arge L, et al. Bkd-tree:A Dynamic Scalable Kd-tree[C]. International Symposium on Spatial and Temporal Databases, Berlin, Germany, 2003 |
[12]
|
Xiao Hui, Yang Bisheng. An Improved KNN Search Algorithm Based on Road Network Distance[J]. Geomatics and Information Science of Wuhan University, 2008, 33(4):437-439(肖晖, 杨必胜. 一种改进的基于道路网络距离的K近邻查询算法[J]. 武汉大学学报\5信息科学版, 2008, 33(4):437-439) |
[13]
|
Dickerson M T, Drysdale R, Sack J R. Simple Algorithms for Enumerating Interpoint Distance and Finding k Nearest Neighbors[J]. International Journal of Computational Geometry and Applications, 1992, 2(3):221-239 |
[14]
|
Goodsell G. On Finding p-th Nearest Neighbors of Scattered Points in Two Dimensions for Small p[J]. Computer Aided Geometric Design, 2000, 17(4):387-392 |
[15]
|
Ma Liming, Xu Yi, Li Zexiang. Fast k-nearest Neighbors Searching Algorithm for Scattered Points Based on Dynamic Grid Decomposition[J]. Computer Engineering, 2008, 34(8):10-11(马骊溟, 徐毅, 李泽湘. 基于动态网格划分的散乱点k邻域快速搜索算法[J]. 计算机工程, 2008, 34(8):10-11) |
[16]
|
Yang Jun, Lin Yanlong, Wang Yangping, et al. Fast Algorithm for Finding The k-nearest Neighbors of A Large-Scale Scattered Point Cloud[J]. Journal of Image and Graphics, 2013, 18(4):399-406(杨军, 林岩龙, 王阳萍, 等. 大规模散乱点的k邻域快速搜索算法[J]. 中国图象图形学报, 2013, 18(4):399-406) |