Discrete Construction of Compoundly Weighted Voronoi Diagram

Article Preview

Abstract:

Compoundly weighted Voronoi diagram is difficult to construct because the bisector is fairly complex. In traditional algorithm, production process is always extremely complex and it is more difficult to graphic display because of the complex definition of mathematic formula. In this paper, discrete algorithms are used to construct compoundly weighted 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 algorithm. The results show that the algorithm is both simple and useful, and it is of high potential value in practice.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

545-548

Citation:

Online since:

December 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] G. Voronoi, Nouvelles.: applications des paramèters continus à la théorie des formes quadratiques. Premier Mémoire: Sur quelques Proprieteés des formes quadratiques positives parfaits, J. Reine Angew, Math. 133, 97-178 (1907).

DOI: 10.1515/crll.1908.133.97

Google Scholar

[2] K.L. Clarkson.: New applications of random sampling in computational geometry. J. Discrete and Computational Geometry. 2, 195-222 (1987).

DOI: 10.1007/bf02187879

Google Scholar

[3] Avneesh Sud, Naga Govindaraju, Russell Gayle, Dinesh Manocha, Z. : Interactive 3D distance field computation using linear factorization. In: Proceedings of the 2006 symposium on Interactive 3D graphics and games, pp.14-17. Redwood City, California (2006).

DOI: 10.1145/1111411.1111432

Google Scholar

[4] Ye Zhao, Shu-juan Liu, Yi-li Tan. Discrete construction of order-k voronoi diagram. ICICA'10 Proceedings of the First international conference on Information computing and applications Springer-Verlag Berlin, Heidelberg 2010, pp: 79-85.

Google Scholar

[5] Ye Zhao, Ya-Jing Zhang, Qing-Hong Zhang: Discrete construction of Voronoi diagrams for cross generators. 2010 International Conference on Machine Learning and Cybernetics, ICMLC 2010, 3, pp: 1556-1559.

DOI: 10.1109/icmlc.2010.5580811

Google Scholar

[6] Zhang, Qinghong, Zhao, Ye. Dynamic construction of network voronoi diagram for lines. Journal of Convergence Information Technology, 2012, 7(22): 245-253.

DOI: 10.4156/jcit.vol7.issue22.29

Google Scholar