An algorithm for searching K-Nearest Neighbors of scattered points based sorted grids is presented.At first,the scattered points are divided into a set of uniform grids,and then sorted the distances between the current point and the grids around it.Searching the grids accord to the distances from small to large until meeting the requirements.Experiments show that the algorithm makes the searching range to be much smaller and the searching speed to be much faster.
| 
推荐 
点击下列相关研究机构和相关文献作者，可以直接查到这些机构和作者被《中国知识资源总库》收录的其它文献，使您全面了解该机构和该作者的研究动态和历史。
