| 带有边界条件的Delaunay三角网生成算法的研究与实现 |
| |
| 引用本文： | 宁化展,徐炳喜,田茂义,张丽.带有边界条件的Delaunay三角网生成算法的研究与实现[J].全球定位系统,2010,35(4):39-42. |
| |
| 作者姓名： | 宁化展 徐炳喜 田茂义 张丽 |
| |
| 作者单位： | [1]山东科技大学测绘科学与工程学院,山东青岛266510 [2]中煤矿山建设集团有限责任公司,合肥安徽230601 [3]峡山生态经济发展区太保庄街道水利站,山东潍坊261325 |
| |
| 摘 要： | Delaunay三角网是构建数字地形模型的主要途径，凸壳是构造Delaunay三角网的基础，一般的凸壳构造方法找到的凸壳为最少点的多边形，但也有多点在一条边界边上的情况。在Delaunay三角网生成算法的基础上，提出了一种新的查找凸壳的算法并导出了带有边界条件的Delaunay三角网生成算法。通过实际数据的测试，表明该算法是有效的。
|
| 关 键 词： | Delaunay 三角网 DTM 凸壳 |
Research and Realizing of Algorithm in Construction of Delaunay Triangulation with Boundary Conditions |
| |
| NING Hua-zhan,XU Bing-xi,TIAN Mao-yi,ZHANG Li.Research and Realizing of Algorithm in Construction of Delaunay Triangulation with Boundary Conditions[J].Gnss World of China,2010,35(4):39-42. |
| |
| Authors: | NING Hua-zhan XU Bing-xi TIAN Mao-yi ZHANG Li |
| |
| Institution: | 1. Shandong University Of Science And Technology Geomatics College, Qingdao Shandong 266510, China ;2. China Coal Mine Construction Group Limited Liability Company, Hefei Anhui 230601, China;3. Xiashan Ecological Economic Zones Taibao zhuang Street on Water, Wei fang Shandong 261325, China) |
| |
| Abstract: | Delaunay triangulation is the main route of construct digital terrain model, convex hull is the basic of construct Delaunay triangulation, general search convex hull method only find the polygon with least points, but more points at one edge exist. The paper proposed a new way finding convex hull and deduses the algorithm of construct delaunay triangulation with boundary conditions on the basis of the algorithm of construct delaunay triangulation. Through the test with actual data, this algorithm is effective. |
| |
| Keywords: | Delaunay triangulation digital terrain model convex hull |
| 本文献已被 维普 万方数据 等数据库收录！ |
