|
|||||
|
|
| 一种高效构建Delaunay三角网的算法 | |
| 引用本文： | 单煦翔,郑滔,李根.一种高效构建Delaunay三角网的算法[J].江南大学学报(自然科学版),2010,9(2):191-195. |
| 作者姓名： | 单煦翔 郑滔 李根 |
| 作者单位： | 1. 苏州市财政局,江苏,苏州,215004 2. 南京大学,软件学院,江苏,南京,210003 3. 江苏大学计算机与通信工程学院,江苏,镇江,212013 |
| 摘 要： | 提出了一种基于改进的Graham扫描法的分块构建不规则三角网算法。采用分割合并的思想,先对平面上的离散点集区域进行分块,然后对各个子块用改进的Graham扫描法生成不规则三角网,再从边界边出发依次合并相邻的三角网子集,直到所有子集合并结束。本算法采用分块的思想缩小了构网时的搜索范围,对子块用改进的Graham法生成三角网提高了算法性能。实验结果表明,本算法使构网效率有很大的提高。 |
| 关 键 词： | Delaunay三角网 数据分块 LOP优化 不规则三角网 |
A High-Efficiency Algorithm of Constructing Delaunay Triangulation |
|
| SHAN Xu-xiang,ZHENG Tao,LI Gen.A High-Efficiency Algorithm of Constructing Delaunay Triangulation[J].Journal of Southern Yangtze University:Natural Science Edition,2010,9(2):191-195. | |
| Authors: | SHAN Xu-xiang ZHENG Tao LI Gen |
| Institution: | 1.Suzhou Bureau of Finance;Suzhou 215004;China;2.School of Software;Nanjing University;Nanjing 210003;3.School of Computer Science and Telecommunication Engineering;Jiangsu University;Zhenjiang 212013;China |
| Abstract: | An algorithm of constructing Delaunay triangulation based on the improved Graham' scan was presented in the paper.The algorithm firstly splits the discrete point sets into several subsets by mesh partition,then it builds triangulated irregular networks on these subsets,finally it merges these triangular networks one by one sequentially.The splitting method of this algorithm can decrease the search scope of points remarkably.The use of improved Graham' scan to build Delaunay triangulation of sub-block increa... |
| Keywords: | delaunay triangulation dataset partition LOP optimizing triangulated irregular networks |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |