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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Voronoi, G.: Nouvelles: applications des paramèters continus à la théorie des formes quadratiques. Premier Mémoire: Sur quelques Proprieteés des formes quadratiques positives parfaits. Reine Angew, Math. 133, 97–178 (1907)
Clarkson, K.L.: New applications of random sampling in computational geometry. Discrete and Computational Geometry 2, 195–222 (1987)
Sud, A., Govindaraju, N., Gayle, R., Dinesh Manocha, Z.: Interactive 3D distance field computation using linear factorization. In: Proceedings of the 2006 Symposium on Interactive 3D Graphics and Games, Redwood City, California, pp. 14–17 (2006)
Qian, B., Zhang, L., Shi, Y., Liu, B.: New Voronoi Diagram Algorithm of Multiply-Connected Planar Areas in the Selective Laser Melting. Tsinghua Science & Technology 14, 137–143 (2009)
Aurenhammer, F., Drysdale, R.L.S., Krasser, H.: Farthest line segment Voronoi diagrams. Information Processing Letters 100, 220–225 (2006)
Chen, J., Zhao, R., Li, Z.: Voronoi-based k-order neighbour relations for spatial analysis. ISPRS Journal of Photogrammetry and Remote Sensing 59, 60–72 (2004)
Lee, I., Lee, K.: A generic triangle-based data structure of the complete set of higher order Voronoi diagrams for emergency management. Computers, Environment and Urban Systems 33, 90–99 (2009)
Cabello, S., Fort, M., Sellarès, J.A.: Higher-order Voronoi diagrams on triangulated surfaces. Information Processing Letters 109, 440–445 (2009)
Chen, J., Zhao, R., Li, Z.: Voronoi-based k-order neighbour relations for spatial analysis. ISPRS Journal of Photogrammetry and Remote Sensing 59, 60–72 (2004)
Wu, Y., Zhou, W., Wang, B., Yang, F.: Modeling and characterization of two-phase composites by Voronoi diagram in the Laguerre geometry based on random close packing of spheres. Computational Materials Science 47, 951–996 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tan, Y., Zhao, Y., Wang, Y. (2011). Discrete Construction of Power Network Voronoi Diagram. In: Liu, B., Chai, C. (eds) Information Computing and Applications. ICICA 2011. Lecture Notes in Computer Science, vol 7030. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25255-6_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-25255-6_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25254-9
Online ISBN: 978-3-642-25255-6
eBook Packages: Computer ScienceComputer Science (R0)