中文摘要：

讨论了Voronoi图的首最邻近递归收敛特性，即从任一伪最邻近对象开始，递归查找其首最邻近对象，最后必然收敛于最邻近对象。利用该特性，初步实现了移动目标直接邻近对象的连续查询。

英文摘要：

In the field of GIS, in-depth study of Voronoi diagram＇s dynamic geometric characteristics will contribute the achievement of complex spatial relations queries. Voronoi diagram＇s recursive convergence characteristic along preferred possible nearest neighbor objects is discussed, i.e. any search from pseudo neighbor object along preferred possible nearest neighbor objects can reach the nearest object. An application case, which realizes continuous queries of moving object＇s immediate neighbor objects based on this characteristics, is used to illustrate the value of this characteristic.