Discrete construction of power network voronoi diagram

Authors:
Yili Tan;Ye Zhao;Yourong Wang
Affiliations:
College of Science, Hebei United University, Tangshan, Hebei, China;Department of Mathematics and Physics, Shijiazhuang Tiedao University, Shijiazhuang, Hebei, China;Department of Basic, Tangshan College, Tangshan, Hebei, China
Venue:
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
Year:
2011

Citing 3
Cited 0

Interactive 3D distance field computation using linear factorization

I3D '06 Proceedings of the 2006 symposium on Interactive 3D graphics and games
Farthest line segment Voronoi diagrams

Information Processing Letters
Higher-order Voronoi diagrams on triangulated surfaces

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Power 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.