移动点的反向最近邻查询

反向最近邻（RNN）查询是空间数据库查询的一个重要的问题。随着无线通讯的发展，时空数据库中反向最近邻查询问题越来越受到关注。本文基于Voronoi图的定义和性质，采用一种不同于Delaunay三角剖分的另外一种三角剖分进行研究，其优势在于对于某个特定点，包含它的三角形的数量较少，查询效率较高。

The reverse nearest neighbor query of the moving points

The reverse nearest neighbor（RNN） query is an important problem in spatial database. With the development of wireless communication, the reverse nearest neighbor（RNN） query in time-spatial database obtain the attention. This paper exploits another triangulation different form Delaunay triangulation which is based on the definition and character of Voronoi diagram. The advantage is that the number of the triangle covering the particular point p is small and the efficiency is high.