Dynamic construction of order-k Voronoi diagram

The order-k Voronoi diagrams are difficult to construct because of their complicated structures. In traditional algorithm, production process was extremely complex. While dynamic algorithm is only concerned with positions of generators, so it is effective for constructing Voronoi diagrams with complicated shapes of Voronoi polygons. It can be applied to order-k Voronoi diagram with any generators, and can get over most shortcomings of traditional algorithm. So it is more useful and effective. Model is constructed with dynamic algorithm. And the application example shows that the algorithm is both simple and useful, and it is of high potential value in practice.