[1] 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. [2] DICKERSON M T, DRYSDALE R L S, SACK J R. Simple algorithms for enumerating inter point distance and finding K nearest neighbors[J]. International Journal of Computational Geometry and Applications, 1992, 2(3):221-239. [3] 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. [4] SANKARANARAY J, SAMET H, VARSHNEY A. A fast all nearest neighbor algorithm for applications involving large point-clouds [J]. Computers & Graphs, 2007, 31(2):157-174. [5] 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, 1998, 45(6): 891-923. [6] MUJA M, LOWE D G. Scalable nearest neighbor algorithms for high dimensional data[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2014, 36(11):2227-2240. [7] 周儒荣, 张丽艳, 苏旭,等.海量散乱点的曲面重建算法研究[J]. 软件学报,2001, 12(2):249-255.(ZHAO R R, ZHANG L Y, SU X, et al. Algorithmic research on surface reconstruction from dense scattered points [J]. Journal of Software, 2001,12(2):249-255.) [8] 熊邦书, 何明一, 余华璟.三维散乱数据的K个最近邻域快速搜索算法[J]. 计算机辅助设计与图形学学报, 2004, 16(7):909-912.(XIONG B S, HE M Y, YU H J. Algorithm for finding K-nearest neighbors of scattered points in three dimensions [J]. Journal of Computer-Aided Design & Computer Graphics, 2004, 16(7):909-912.) [9] PIEGL L A, TILLER W. Algorithm for finding all K-nearest neighbors [J]. Computer-Aided Design, 2002, 34(2):167-172. [10] 马骊溟, 徐毅, 李泽湘. 基于动态网格划分的散乱点K邻域快速搜索算法[J]. 计算机工程, 2008, 34(8):10-11.(MA L M, XU Y, LI Z X. Fast K-nearest neighbors searching algorithm for scattered points based on dynamic grid decomposition [J]. Computer Engineering, 2008, 34(8):10-11.) [11] 刘越华, 廖文和, 刘浩.逆向工程中散乱点云的K邻域搜索算法研究[J]. 机械设计与制造, 2012,1(3):256-258.(LIU Y H, LIAO W H, LIU H. Research of K-nearest neighbors search algorithm in reverse engineering [J]. Machinery Design & Manufacture, 2012,1(3):256-258.) [12] 赵俭辉, 龙成江, 丁乙华,等. 一种基于立方体小栅格的k邻域快速搜索算法[J]. 武汉大学学报(信息科学版), 2009, 34(5):615-618.(ZHAO J H, LONG C J, DING Y H, et al. A fast algorithm for finding k-nearest neighbors based on small cube grids [J]. Geomatics and Information Science of Wuhan University, 2009, 34(5):615-618.) [13] 杨军, 林岩龙, 王阳萍,等.大规模散乱点的K邻域快速搜索算法[J]. 中国图象图形学报, 2013, 18(4):399-406.(YANG J, LIN Y L, WANG Y P, 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.) |