Lecture notes in computer science: research on hybrid grid algorithm of voronoi diagram

被引:0
|
作者
Wang, Binjun [1 ]
Wang, Qiushi [2 ]
Li, Jingying [1 ]
机构
[1] Peoples Publ Secur Univ China, Dept Informat Technol & Cybersecur, 2-3-602,29 Leyuan load, Beijing 100240, Peoples R China
[2] Minist Publ Secur PRC, Res Inst 1, Dept IOT, Beijing 100048, Peoples R China
关键词
D O I
10.1051/itmconf/20181703005
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Characteristics and performance of two grid methods, which include the growth method and the point by point scanning method of Voronoi diagram, are analyzed qualitatively and quantitatively. The theoretical analysis and experimental results show that the growth method is faster, but the boundary of Voronoi diagram generated by the point by point scanning method is more accurate. By combining the advantages of these two grid methods, the hybrid grid algorithm is proposed: the growth method is used firstly to extend a large step, and then the point by point scanning method is used to color the remaining blank pixel. The theoretical analysis and experimental results show that the speed of the hybrid grid algorithm is close to the fastest growth algorithm, and the accuracy is as well as the point by point scanning algorithm.
引用
收藏
页数:10
相关论文
共 50 条