Affiliation:
1. Chengde Petroleum College
Abstract
Voronoi Diagram for a set of points and straight line segments is difficult to construct because general figures have uncertain shapes[. In traditional algorithm, when generator of general figure changes, production process will be extremely complex because of the change of regions neighboring with those generator changed. In this paper, we use dynamicconstruction of 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[2]. The results show that the algorithm is both simple and useful, and it is of high potential value in practice.
Publisher
Trans Tech Publications, Ltd.
Reference11 articles.
1. Kazuhiro Yamada and Kokichi Sugihara. Approximation of Voronoi diagrams for figures and its improvement, Department of Mathematical Engineering and Information Physics, Graduate School of Engineering, University of Yokyo, (1996).
2. Takafumi Watanabe and Sadayuki Murashima. A method to construct a Voronoi diagram on 2-D digitized space (1) computing time, . Faculty of Engineering, Kagoshima.
3. Voronoi,G. Nouvelles. applications des parameters continues a la theorie des formes quadratiques, Deuxieme memoire: Recherches sur les parplleloedres primitives. Math, 1908, (134): 198-287.
4. Edetsbrunner H. Smooth surfaces for multiscale shaperepresentation, , Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science, Bangalore, 1995. 391-412.
5. Yang Cheng-Lei, Wang Jia-Ye, Meng Xiang-Xu,. Upper Bounds on the Size of Inner Voronoi Diagrams of Multiply Connected Polygons, Journal of Software, 2006. 7, 17(7): 1527-1534.