基于曲面拟合的三角形网格简化

摘要

A triangular mesh simplification algorithm is proposed for the mesh simplification in Computer-aided Engineering(CAE) computation. In this algorithm, mesh is simplified by edge collapses and triangle collapses, and different simplifying schemes are adopted to gain adaptive Level-of-Detail(LOD) mesh according to geometric features of mesh recognized by the node discrete degree. During the simplification, in order to optimize mesh and preserve features the goal points in collapse are predicted by optimizing the triangular elements' aspect ratio and lastly extracted by fitting surfaces around. It is proved that this algorithm can simplify mesh efficiently, and reduce the computation time up to 75%.%针对有限元网格简化问题,将边折叠和三角形折叠算法相结合,提出一种基于曲面拟合的网格简化方法.根据节点离散度识别网格特征,对具有不同特征的部位采用不同的简化策略从而实现自适应变密度网格简化.按长高比最优原则对合并后的节点进行预测,运用曲面拟合技术最终确定合并后的节点,达到优化网格和保持网格特征的目的.实验结果证明,该方法能在保证网格质量的前提下有效简化网格模型,提高CAE分析速度,最多可缩短75％的计算时间.