| 应用一级邻近点生成加权Voronoi图的思想 |
| |
| 引用本文： | 陈静静,闫浩文.应用一级邻近点生成加权Voronoi图的思想[J].重庆工学院学报,2008,22(1):85-88. |
| |
| 作者姓名： | 陈静静 闫浩文 |
| |
| 作者单位： | 兰州交通大学数理与软件工程学院 兰州730070 |
| |
| 摘 要： | 加权Voronoi图是普通Voronoi图的一种扩展形式,在Voronoi图中各Voronoi边是在2个互为一级邻近点的点之间形成的,基于该理论,给出了一种生成加权Voronoi图的思想:用Delaunay三角网先找出各点的一级邻近点,再按加权Voronoi图的性质计算出各点的Voronoi边的数据,最后根据数据画出加权Voronoi图.
|
| 关 键 词： | 加权Voronoi图 一级邻近点 Delaunay三角网 |
Thought of Drawing Weighted Voronoi Diagram with 1-order Neighbor |
| |
| CHEN Jing-jing,YAN Hao-wen.Thought of Drawing Weighted Voronoi Diagram with 1-order Neighbor[J].Journal of Chongqing Institute of Technology,2008,22(1):85-88. |
| |
| Authors: | CHEN Jing-jing YAN Hao-wen |
| |
| Abstract: | Weighted Voronoi Diagrams are extensions of Voronoi diagrams, and in Voronoi diagram,a Voronoi edge is drawn between 1-order neighbor points.Based on this theory,a thought of drawing weighted Voronoi diagrams is proposed: firstly,finding the 1-order neighbor with Delaunay Triangulation;secondly,calculating the data of Voronoi line of every point with Voronoi diagram properties;and lastly drawing Weighted Voronoi diagrams with these data. |
| |
| Keywords: | weighted Voronoi diagram 1-order neighbor Delaunay triangulation |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
