Power network voronoi diagram and dynamic construction

被引：5

作者：

Tan, Yili ^{[1
]}

Zhao, Ye ^{[2
,3
]}

Wang, Yourong ^{[2
,3
]}

机构：

[1] College of Science, Hebei United University

[2] Department of Mathematics and Physics, Shijiazhuang Tiedao University

[3] Department of Basic, Tangshan College

来源：

Journal of Networks | 2012年 / 7卷 / 04期

关键词：

Discrete; Network voronoi diagram; Power network voronoi diagrams;

D O I：

10.4304/jnw.7.4.675-682

中图分类号：

学科分类号：

摘要：

Objective Voronoi diagrams are important in many fields in a series of sciences. Network Voronoi diagrams are useful to investigate dominance regions in a grid street system or a radial-circular street system. However, all generators may have different effect. To deal with a network Voronoi diagram with varied functions of generators, it must be worth formulating a power network Voronoi diagram. Method Adding weight value on generators, which is used to indicate factors related to are difficult to construct when the position relation of generators. Results A new concept of power network Voronoi diagram are proposed. In accordance with discrete construction method, achieved the construction of power network Voronoi diagram. Conclution The application example shows that the algorithm is both simple and useful, and it is of high potential value in practice. Power network Voronoi diagram both perfected the theory about Voronoi diagrams, and extended the range of applications of Voronoi diagrams. © 2012 ACADEMY PUBLISHER.

引用

页码：675 / 682

页数：7

共 15 条

[1] Alliez P., Cohen-Steiner D., Devillers O., Levy B., Desbrun M., Anisotropic polygonal remeshing, ACM Transactions on Graphics (TOG), 22, 3, (2003)
[2] Boissonnat J.-D., Oudot S., Provably Good Sampling and Meshing of Lipschitz Surfaces, Proceedings of the Twenty-second Annual Symposium on Computational Geometry, (2006)
[3] Edetsbrunner H., Smooth surfaces for multiscale shaperepresentation, Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 391-412, (1995)
[4] Bommes D., Zimmer H., Kobbelt L., Mixedinteger quadrangulation, ACM Transactions on Graphics (TOG), 28, 3, (2009)
[5] Bae S.W., Chwa K.-Y., The geodesic farthest-site Voronoi diagram in a polygonal domain with holes, Proceedings of the 25th Annual Symposium on Computational Geometry, (2009)
[6] Xuan K., Zhao G., Taniar D., Srinivasan B., Safar M., Gavrilova M., Network Voronoi Diagram Based Range Search, Proceedings of the 2009 International Conference on Advanced Information Networking and Applications, pp. 741-748, (2009)
[7] Liu Y., Wang W., Levy B., Sun F., Yan D.-M., Lin L., Yang C., On centroidal voronoi tessellation-energy smoothness and fast computation, ACM Transactions on Graphics (TOG), 28, 4, pp. 1-17, (2009)
[8] Chen Z., Shen H.T., Zhou X., Zheng Y., Xie X., Searching trajectories by locations: An efficiency study, Proceedings of the 2010 International Conference on Management of Data, (2010)
[9] Mozosa O.M., Jose A., Boleab J.A., Ferrandezc J.M., Ahneltd P.K., Fernandez E., VProportion: A Method Based on the Voronoi Diagram to Study Spatial Relations in Neuronal Mosaics of the Retina
[10] Liu Y., Wang W., Levy B., Sun F., Yan D.-M., Lin L., Yang C., On centroidal voronoi tessellation-energy smoothness and fast computation, ACM Transactions on Graphics (TOG), 28, 4, pp. 1-17, (2009)

← 1 2 →