| 一种基于图的平面点集Delaunay三角剖分算法 |
| |
| 引用本文： | 马小虎,董军,潘志庚,石教英.一种基于图的平面点集Delaunay三角剖分算法[J].中国图象图形学报,1997,2(1):7-11. |
| |
| 作者姓名： | 马小虎 董军 潘志庚 石教英 |
| |
| 作者单位： | 浙江大学ＣＡＤ＆ＣＧ国家重点实验室 |
| |
| 摘 要： | 本文提出了一种基于图的平面点集Ｄｅｌａｕｎａｙ三角剖分算法。该算法首先求出平面点集的欧几里得最小生成树，然后逐次加入一边构造三角形网格，最后按最小内角最大的三角化准则，通过局部变换，得到平面点集的Ｄｅｌａｕｎａｙ三角剖分。本文同时阐述了它的对偶图；平面点集的Ｖｏｒｏｎｏｉ图的概念和性质。
|
| 关 键 词： | 最小生成树 平面点集 三角剖分 计算机图形学 |
A Graph-Based Algorithm for Generating the
Delaunay Triangulation of a Planar Point Set |
| |
| Ma Xiaohu,Dong Jun,Pan Zhigeng and Shi Jiaoying.A Graph-Based Algorithm for Generating the
Delaunay Triangulation of a Planar Point Set[J].Journal of Image and Graphics,1997,2(1):7-11. |
| |
| Authors: | Ma Xiaohu Dong Jun Pan Zhigeng and Shi Jiaoying |
| |
| Abstract: | A graph-based algorithm for generating the Delaunay triangulation of aplanar point set is
presented in this paper. The first step is to calculate the Euclidean Minimum Spanning Tree (EM ST) of
the given points. The EM ST is then augumented to triangle mesh. Finally the Delaunay Triangulation of
the given points is obtained by local tranformation acording to Max-M in angle criteria. The concepts and
properties of Vorono i diagram of a planar point set are slso discussed in the paper. |
| |
| Keywords: | Euclidean minimum spanning tree Planar point set Delaunay triangulation Vorono i diagram |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《中国图象图形学报》浏览原始摘要信息 |
|
点击此处可从《中国图象图形学报》下载免费的PDF全文 |
