首页 | 本学科首页   官方微博 | 高级检索  
     检索      

Delaunay三角网剖分中嵌入约束边的局部调整算法
引用本文:宋占峰,詹振炎,蒲浩.Delaunay三角网剖分中嵌入约束边的局部调整算法[J].西南交通大学学报,2002,37(4):399-402.
作者姓名:宋占峰  詹振炎  蒲浩
作者单位:中南大学铁道校区土木建筑学院,湖南,长沙,410075
基金项目:铁道部科技发展计划项目 (97G2 3-F,96G30G -1),湖南省科委项目(省重点 0 1- 96 1- 18- 4 )
摘    要:提出了一种建立约束Delaunay三角网(CDT)的算法,该算法对约束数据集先建立非约束Delaunay三角网,然后嵌入约束边对其影响域按角度最大原则进行局部调整,同时使其满足CDT的性质。详细地说明了在CDT中嵌入约束边的过程,同时给出了三角网拓扑关系更新的方法,最后对算法的时间效率进行了分析。该算法执行效率高,并且运行稳定。

关 键 词:Delauna三角网剖分  约束边  局部调整算法  三角部分  数字地面模型  拓扑关系  GIS
文章编号:0258-2724(2002)04-0399-05

A Local Adjustment Algorithm for Inserting Constrained Segments in Delaunay Triangulation
SONG Zhan feng,ZHAN Zhen yan,PU Hao.A Local Adjustment Algorithm for Inserting Constrained Segments in Delaunay Triangulation[J].Journal of Southwest Jiaotong University,2002,37(4):399-402.
Authors:SONG Zhan feng  ZHAN Zhen yan  PU Hao
Abstract:An algorithm for constructing constrained Delaunay triangulation (CDT) is presented. First, the Delaunay triangulation for constrained data sets is constructed. Then, by inserting constrained segments into the Delaunay triangulation, a local adjustment is made to its impact area on the maximum angle principle on the condition that the basic properties of CDT are satisfied. Meanwhile, the process of inserting the constrained segments into CDT is expounded in detail, and the updating method for the topological relations in CDT is presented. Finally, the time efficiency of the algorithm proposed is analyzed. It is shown that the algorithm has a high efficiency and a stable operation.
Keywords:triangulation nets  triangulation  algorithms  digital terrain models  topological relation
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号