A Faster Algorithm of Higher Order Voronoi Diagrams

Higher order Voronoi diagrams play important roles in settling the problems of k neighbors. Several algorithms for generating higher order Voronoi diagrams have been found until now. However, they all have complex data structures and high price. In this paper, the authors propose a faster algorithm using adaptive partition screen to search for k neighbors locally based on Fixed Upper Bound theorem. The experiment shows that the new algorithm not only can generate many kinds of different higher order Voronoi diagrams, but also has simple data structure and higher speed.