| 动态Voronoi图的算法实现 |
| |
| 引用本文： | 王建文. 动态Voronoi图的算法实现[J]. 河北工程技术高等专科学校学报, 2009, 0(3): 22-24 |
| |
| 作者姓名： | 王建文 |
| |
| 作者单位： | 河北工程技术高等专科学校,计算机系,河北,沧州,061001 |
| |
| 摘 要： | 文中讨论了一种动态生成Voronoi图的构造算法。该算法以Delaunay三角网和相应的Voronoi图的对偶关系为基础,利用3个额外生长点,动态实现Delaunay三角网,然后根据优化后的三角网生成最终的Voronoi图。
|
| 关 键 词： | Voronoi图 Delaunay三角网 增量算法 |
The Algorithm Realization of Dynamic Voronoi Drawing |
| |
| WANG Jian-wen. The Algorithm Realization of Dynamic Voronoi Drawing[J]. Journal of Hebei Engineering and Technical College Quarterly, 2009, 0(3): 22-24 |
| |
| Authors: | WANG Jian-wen |
| |
| Affiliation: | WANG Jian-wen (Department of Computer Science, Hebei Engineering and Technical College, Cangzhou 061001, China) |
| |
| Abstract: | This paper has discussed a new way for dynamically generating Voronoi drawing.Based on the dual relationship between the Delaunay triangulation network and its corresponding Voronoi drawing,this algorithm will use three additional growing points to dynamically form the Delaunay triangulation network,and then generate the Voronoi drawing through the optimized triangulation network. |
| |
| Keywords: | Voronoi drawing Delaunay triangulation network |
| 本文献已被 维普 万方数据 等数据库收录！ |
