Discrete Construction of Compoundly Weighted Voronoi Diagram

被引:0
作者
Wang, Hui [1 ]
机构
[1] Chengde Petr Coll, Dept Math & Phys, Chengde 067000, Hebei, Peoples R China
来源
MATERIALS SCIENCE AND MECHANICAL ENGINEERING | 2014年 / 467卷
关键词
Voronoi diagram; Compoundly weighted; Discrete;
D O I
10.4028/www.scientific.net/AMM.467.545
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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.
引用
收藏
页码:545 / 548
页数:4
相关论文
共 6 条
  • [1] NEW APPLICATIONS OF RANDOM SAMPLING IN COMPUTATIONAL GEOMETRY
    CLARKSON, KL
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1987, 2 (02) : 195 - 222
  • [2] Sud Avneesh., 2006, Proceedings of the 2006 symposium on Interactive 3D graphics and games, P14
  • [3] Voronoi G., 1907, J REINE ANGEW MATH, V133, P97, DOI DOI 10.1515/CRLL.1908.133.97
  • [4] Zhang Qinghong, 2012, J CONVERGENCE INFORM, V7, P245
  • [5] Zhao Y, 2010, LECT NOTES COMPUT SC, V6377, P79, DOI 10.1007/978-3-642-16167-4_11
  • [6] Zhao Ye, 2010, 2010 INT C MACH LEAR, V3, P1556