Abstract: This paper discusses how to find all split points covered by a new insert point. It proposes a direct comparison method, which is appliedto search one nearest neighbor of moving objects. Its computation is fewer than the method taken by the CNN search algorithm. And It also proposesa dynamic comparison method, which is applied to search multiple nearest neighbors of moving objects.

摘要： 对如何寻找一个新插入点覆盖的所有分点问题进行了研究,提出了适用于搜索移动对象的一个最近邻居的直接比较方法,其计算量要少于原来CNN搜索算法所采用的方法。对于搜索移动对象的多个最近邻居的情况,提出了一种避免计算新插入点到所有分点距离的动态比较方法。

关键词: 移动对象, 最近邻居, CNN搜索

CLC Number: 

• TP301.6