| 二维Delaunay三角网的任意点插入算法研究 |
| |
| 引用本文： | 张咏,杨瑜华,董汉军.二维Delaunay三角网的任意点插入算法研究[J].地理与地理信息科学,2009,25(4). |
| |
| 作者姓名： | 张咏 杨瑜华 董汉军 |
| |
| 作者单位： | 1. 西安科技大学测绘科学与技术学院,陕西,西安,710054
2. 中冶成工上海五冶建设有限公司,上海,201900 |
| |
| 摘 要： | 针对目前各种点插入算法的不足,提出一种二维Delaunay三角网任意点插入算法。首先基于凸壳区分点的位置,并利用三角形面积坐标、重心和点与有向线段关系三者构建的融和算法搜索插入点所在三角形,然后通过构建和优化新三角形完成点的插入,且满足Delaunay法则。通过测试证明了算法的可靠性和高效性。
|
| 关 键 词： | 不规则三角网 点插入 点定位 凸壳 |
Study on the Algorithm for Two-Dimensional Random Point Insertion of Delaunay TIN |
| |
| ZHANG Yong,YANG Yu-hua,DONG Han-jun.Study on the Algorithm for Two-Dimensional Random Point Insertion of Delaunay TIN[J].Geography and Geo-Information Science,2009,25(4). |
| |
| Authors: | ZHANG Yong YANG Yu-hua DONG Han-jun |
| |
| Institution: | 1.College of Mapping and Geomatics Technology;Xi'an University of Science and Technology;Xi'an 710054;2.MCC Chenggong Shanghai Wuye Construction Co.Ltd;Shanghai 201900;China |
| |
| Abstract: | At present,there are many algorithms for the point insertion of Delaunay TIN,but their efficiency is low.There are many factors that restrict the speed of point insertion.The most important reason is how to locate point in the triangle.According to the number of arithmetic steps in the algorithm,the operating efficiency can be measured quantitatively.Firstly,in this paper,the point location algorithm of the shortest path was analyzed by using of the advantages of existing algorithms.The point location was d... |
| |
| Keywords: | TIN point insertion point location convex hull |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
