|
|||||
|
|
| Delaunay三角网关键技术探讨 | |
| 引用本文： | 李小秋,许民献,尹志永.Delaunay三角网关键技术探讨[J].测绘工程,2011,20(6):61-63,67. |
| 作者姓名： | 李小秋 许民献 尹志永 |
| 作者单位： | 1. 桂林市测绘研究院,广西桂林,541002 2. 河北省第三测绘院,河北石家庄,050031 3. 河北省基础地理信息中心,河北石家庄,050031 |
| 摘 要： | 利用计算机技术,基于实际测量数据,利用逐点插入法,在不建立格网索引的情况下,提出一种高效的Delaunay三角网构建方法,与建立格网索引法搜索点所在的三角形相比,具有较高的执行效率. |
| 关 键 词： | Delaunay 不规则三角网 TIN 数据结构 |
Discussion on key technology of the Delaunay triangulated network |
|
| LI Xiao-qiu,XU Min-xian,YIN Zhi-yong.Discussion on key technology of the Delaunay triangulated network[J].Engineering of Surveying and Mapping,2011,20(6):61-63,67. | |
| Authors: | LI Xiao-qiu XU Min-xian YIN Zhi-yong |
| Institution: | 1.Guilin Institute of Surveying and Mapping,Guilin 541002,China;2.Hebei the Third Bureau of Surveying and Mapping,Shijiazhuang 050031,China;3.Hebei Geomatics Center,Shijiazhuang 050031,China) |
| Abstract: | A new efficient Delaunay triangulated network construction method is introduced using incremental inserting method based on real survey data without setting up grid index.Comparing with grid index method to find the triangle with the searching points located,this method has much higher executing efficiency. |
| Keywords: | Delaunay irregular triangle network TIN data structure |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |