一种前沿推进的自适应三角网生成算法  

Front Advancing Adaptive Triangular Mesh Generation Algorithm

作　　者：马钧霆 陈锁忠[1] 刘欢[1] 张洁[1] 

机构地区：[1]南京师范大学虚拟地理环境教育部重点实验室,江苏南京210023

出　　处：《地理与地理信息科学》2015年第5期14-19,共6页Geography and Geo-Information Science

基　　金：江苏省高校自然科学研究重大项目(10KJA170028)

摘　　要：现有前沿推进算法在利用前沿推进法对二维平面区域进行自适应三角网剖分时,由于前沿边形态包含复杂的几何特征,导致网格单元质量不高、算法速度慢、鲁棒性低。该文提出一种兼顾三角单元质量及鲁棒性的三角网生成算法。首先,将前沿边内向推进过程中的所有形态归纳为4种类型;然后利用候选网格点试探算法构建最优三角单元,并通过相邻前沿线段内夹角搜索阈值分级让步的方式维护算法鲁棒性。实验表明:该算法能够快速识别并处理复杂的前沿边形态特征,生成单元疏密过渡均匀且质量较高的自适应三角网。The front line morphology contains relatively complex geometrical characteristics as the front advancing inside the domain to be triangulated when using advancing front technique.Current AFT algorithms lead to a low quality generated mesh.In this paper,a mesh generation algorithm concerning both element quality and algorithm robustness is proposed.Firstly,all the possibly occurred front line geometric features are taken into consideration and summarized into four types.And then,in order to construct the triangular mesh element with best quality,a candidate point test algorithm is proposed and realized,and the algorithm′s robustness is maintained by using a compromise method that gradually increases the value threshold of searching angle between two adjacent front segments.The experiments demonstrate that the proposed mesh generator is capable of identifying and dealing with complex front line morphology,and discretizing the planar domain into a well-graded,high quality adaptive mesh with element size compatible with the user specification.

关 键 词：前沿推进法 自适应三角网 让步算法 网格质量 

分 类 号：P208[天文地球—地图制图学与地理信息工程]