面向有限元分析的三角网格迭代优化  

Iterative Optimization of Triangle Meshing for FEM Analysis

作　　者：沈建国[1] 陈志杨[2] 张引[1] 张三元[1] 叶修梓[1] 

机构地区：[1]浙江大学CAD&CG国家重点实验室,杭州310027 [2]浙江工业大学软件学院,杭州310014

出　　处：《计算机辅助设计与图形学学报》2009年第12期1715-1721,共7页Journal of Computer-Aided Design & Computer Graphics

基　　金：国家"八六三"高技术研究发展计划(2007AA01Z311;2007AA04Z1A5);教育部博士点基金(20060335114);浙江省科技计划项目(2007C21006;2009C31034)

摘　　要：从逆向工程或者简单离散实体模型得到的网格质量较差,通常不能直接用于有限元分析,为此提出一种迭代优化算法.首先对给定网格进行细分得到足够的自由度,以改变网格的几何和拓扑;然后在误差允许的范围内,通过简化和规则化来提高网格质量.该过程不断迭代,直到网格质量满足分析要求或者达到迭代上限.实验结果表明,该算法既能灵活地控制网格属性,又能有效地提高网格质量.The mesh generated by reverse engineering or simple tessellations of solid models usually cannot be directly applied to analysis due to bad quality. An iterative optimization algorithm is proposed. Mesh is first refined to get enough degree of freedom for changing topology and geometry. Then within a given tolerance the mesh quality is improved by simplification and regularization. This progress is iterated until the mesh quality meets the requirement or a given maximum number of iterations are reached. The experimental results are given to demonstrate the flexibility and effectiveness of the proposed algorithm.

关 键 词：有限元 网格优化 网格细分 网格简化 网格规则化 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]