| 一种基于逐点插入Delaunay三角剖分生成Voronoi图的算法 |
| |
| 引用本文： | 黄清华. 一种基于逐点插入Delaunay三角剖分生成Voronoi图的算法[J]. 微型电脑应用, 2014, 0(6): 43-45 |
| |
| 作者姓名： | 黄清华 |
| |
| 作者单位： | 复旦大学,上海200433 |
| |
| 摘 要： | 采用改进的逐点插入算法生成Voronoi图。该算法在逐点插入的过程中生成凸壳，进而生成Delaunay三角剖分。在生成Voronoi图的实现过程中，通过遍历三角形的边顶点快速识别相关的三角形组，进而生成Voronoi图。试验结果表明，该算法能实现，成功生成Voronoi图。
|
| 关 键 词： | 逐点插入 凸壳 Delaunay三角剖分 Voronoi图 |
A Voronoi Generation Algorithm Based on Point Insertion Algorithm of Delaunay Triangula-tion |
| |
| Huang Qinghua. A Voronoi Generation Algorithm Based on Point Insertion Algorithm of Delaunay Triangula-tion[J]. Microcomputer Applications, 2014, 0(6): 43-45 |
| |
| Authors: | Huang Qinghua |
| |
| Affiliation: | Huang Qinghua (School of Communication and Engineering, Fudan University, Shanghai 200433, China) |
| |
| Abstract: | An improved Voronoi generation algorithm based on point insertion algorithm of Delaunay triangulation is presented in this paper. The algorithm generates the convex hull in the process of inserting point by point and then generates Delaunay triangulation. In the process of generating the Voronoi diagram, the algorithm identifies related triangles rapidly by traversing the edge vertic-es. The experimental results show that the algorithm generates Voronoi diagram successfully. |
| |
| Keywords: | Point Insertion Convex Hull Delaunay Triangulation Voronoi Diagram |
| 本文献已被 维普 等数据库收录！ |
