参考文献
[ 1 ] Sarkar M, Leong T Y. Application of k-nearest
Neighbors Algorithm on Breast Cancer Diagnosis
Problem [C] / / Proc. of American Medical Informatics
Association Annual Symposium. Los Angeles, USA: IEEE Computer Society Press,2000:759-763.
[ 2 ] Procopiuc O,Agarwal P K,Arge L,et al. Bkd-tree:A
Dynamic Scalable kd-tree [ C ] / / Proc. of International
Symposium on Spatial and Temporal Databases. Berlin, Germany:Springer,2003:46-65.
[ 3 ] 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.
[ 4 ] 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.
[ 5 ] Dickerson M T, Drysdale R L S, 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.
[ 6 ] 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.
[ 7 ] 周儒荣,张丽艳,苏 旭,等. 海量散乱点的曲面重建
算法研究[J]. 软件学报,2001,12(2):249-255.
[ 8 ] 熊邦书,何明一,余华璟. 三维散乱数据的k 个最近邻
域快速搜索算法[J]. 计算机辅助设计与图形学学报,
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]. 武汉大学学报:信息科学
版,2009,34(5):615-618.
[11] 马 娟,方源敏,赵文亮,等. 利用空间微分块与动态
球策略的k 邻域搜索算法研究[J]. 武汉大学学报:
信息科学版,2011,36(3):358-362.
[12] 马骊溟,徐 毅,李泽湘. 基于动态网格划分的散乱点
k 邻域快速搜索算法[J]. 计算机工程,2008,34(8):
10-11.
[13] 杨 军,林岩龙,王阳萍,等. 大规模散乱点的k 邻域
快速搜索算法[J]. 中国图象图形学报,2013,18(4):
399-406.
[14] Jivani A G. The Novel k Nearest Neighbor Algorithm
[C] / / Proc. of International Conference on Computer
Communication and Informatics. Coimbatore, India: IEEE Computer Society Press,2013:1-4.
编辑 顾逸斐 |