计算机工程 ›› 2009, Vol. 35 ›› Issue (19): 81-82,8.doi: 10.3969/j.issn.1000-3428.2009.19.026

• 软件技术与数据库 • 上一篇    下一篇

基于Voronoi图的反向最近邻查询

刘润涛1,张佳佳2   

  1. (1. 哈尔滨理工大学信息与科学计算技术研究所,哈尔滨 150080;2. 哈尔滨理工大学应用科学学院,哈尔滨 150080)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-10-05 发布日期:2009-10-05

Reverse Nearest Neighbor Search Based on Voronoi Diagram

LIU Run-tao1, ZHANG Jia-jia2   

  1. (1. Institute of Information and Scientific Computing Technology, Harbin University of Science and Technology, Harbin 150080; 2. College of Applied Science, Harbin University of Science and Technology, Harbin 150080)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-10-05 Published:2009-10-05

摘要: 为了解决反向最近邻查询问题,利用Voronoi图及数据集中点的凸包进行反向最近邻查询,通过判断查询点与凸包的位置关系,可去除大量的数据点,并且给出在数据点被加入或删除后,对查询点的反向最近邻变化情况的判断方法与算法。为了便于查询,设计相应的空间存储数据结构。比较分析表明,该方法在处理多个查询点的反向最近邻时有一定的优势。

关键词: 反向最近邻, Voronoi图, 凸包

Abstract: In order to solve Reverse Nearest Neighbor(RNN) search in a dataset, Voronoi diagram and the hulls of dataset are used for RNN search. By determinating the location relation between query point and convex hulls, many points can be cut. And an algorithm and judgment method for the change of the RNN of query point are given when data points are added or deleted. To be convenient to search, corresponding spatial storage structures are designed. Comparative analysis shows that this method has evident advantages when many query points are dealt with.

Key words: Reverse Nearest Neighbor(RNN), Voronoi diagram, convex hull

中图分类号: