摘要
最近邻查询是地理信息系统等领域经常遇到的问题,该文在最近邻查询的基础上提出一种多个对象的最近邻查询,并利用已有的R-树最近邻查询方法实现多个对象的查询,该方法不同于普通的最近邻查询,是一种新的方法,在实际应用中也很有意义。
Nearest neighbor query is very common in geographic information system, so this paper proposes a new concept of multiple query objects based on it. And the algorithm using R-tree to find NN of one point is taken here. The algorithm this paper proposes is simple, but it is new and meaningful.
出处
《计算机工程》
CAS
CSCD
北大核心
2004年第11期66-68,共3页
Computer Engineering
关键词
R-树
最近邻
空间对象
R-tree
Nearest neighbor
Spatial object
