Dynamic Construction of Additively Weighted Network Voronoi Diagram

Abstract

Additively weighted network Network Voronoi diagrams are difficult to construct when the position relation of road segments are complicated. In traditional algorithm, The distance between objects must be calculated by selecting the minimum distance to their shared borders and doubling this value. When road segments cross or coincide with each other, production process will be extremely complex because we have to consider separately these parts. In this paper, we use discrete construction of network Voronoi diagrams. The algorithm can get over all kinds of shortcomings that we have just mentioned. So it is more useful and effective than the traditional ones. We also construct model according the algorithm. And the application example shows that the algorithm is both simple and useful, and it is of high potential value in practice.