| 基于凸壳技术的Delaunay三角网生成算法 |
| |
| 引用本文： | 陈学工,陈树强,王丽青. 基于凸壳技术的Delaunay三角网生成算法[J]. 计算机工程与应用, 2006, 42(6): 27-29 |
| |
| 作者姓名： | 陈学工 陈树强 王丽青 |
| |
| 作者单位： | 中南大学信息科学与工程学院,长沙,410083;中南大学信息物理工程学院,长沙,410083 |
| |
| 摘 要： | 该文提出了一种针对散乱点集的快速构建Delaunay的算法。该算法首先对散乱点按有向角进行排序,以排序后的点顺序为基础,利用凸壳特性快速将散乱点联结成三角网,最后利用拓扑结构快速将其优化为Delaunay三角网。在联网过程中,充分利用有序点子集的凸壳特性,避免了所有的交点测试,从而保证了对散乱点集生成Delaunay三角网的效率。
|
| 关 键 词： | Delaunay三角剖分 凸壳 计算几何 |
| 文章编号： | 1002-8331-（2006）06-0027-03 |
| 收稿时间： | 2005-09-01 |
| 修稿时间： | 2005-09-01 |
An Algorithm of Building Delaunay Triangulation Based on Convex Hull |
| |
| Chen Xuegong,Chen Shuqiang,Wang Liqing. An Algorithm of Building Delaunay Triangulation Based on Convex Hull[J]. Computer Engineering and Applications, 2006, 42(6): 27-29 |
| |
| Authors: | Chen Xuegong Chen Shuqiang Wang Liqing |
| |
| Affiliation: | 1.School of Information Science and Engineering,Central South University,Changsha 410083;2.School of Info-physics and Geomatics Engineering,Central South University,Changsha 410083 |
| |
| Abstract: | The paper presents an algorithm of building Delaunay triangulation of scattered point set.Firstly all scattered points are stored in angle.Secondly the sorted points are added to triangular mesh which has created using convex hull technology.Finally triangular mesh is optimized into Delaunay triangulation using topological structures.In process of adding point to triangular mes.h,a few points should be test for the fully using the character of convex hull. Experimental results show that the method is robust and efficient in computation. |
| |
| Keywords: | Delaunay triangulation convex hull computational geometry |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
