基于动态创建局部Voronoi图的连续近邻查询

在充分认识到k阶Voronoi图在解决连续k个近邻查询优越性和现实不可行性的基础上，用分支限界的思想去界定预创建Voronoi图生成点范围的上界，提出了一种动态地创建局部Voronoi图的办法解决连续近邻查询问题。该方法只是在给定查询段上所有点的k个近邻范围上界内创建一个局部的k阶Voronoi图，这样大大降低了基于Voronoi图的连续k近邻查询的代价。

Continuous nearest neighbors queries based on dynamically constructing local Voronoi diagram

Based on the conception of division and bound to decide the upper bound of scope of Voronoi generaters,this paper proposed a method which dynamically construct partial Voronoi diagrams to resolve CNN query.This method takes points of k nearest neighbors of every point on given line segment as generaters to construct a k-order Voronoi diagram to resolve k CNN query.Lowered the cost of the continuous k nearest neighbors query based on Voronoi diagrams.