面向同步建模分析的三角网格局部光顺优化算法

摘要

For large and complicated geometry,it is not feasible to produce high quality mesh using au-tomated algorithms at once.There are so many problems in meshing of faces,such as narrow elements on edges,sharp elements in face,and so on.In this paper,we present a local smoothing algorithm which combines the advantages of global smoothing method and local deterministic method.This algorithm a-voids substantial consumption of computer resources and obtains more reliable results than the traditional algorithm.The implementation results show that the mesh elements will be well-distributed in size and homogeneous in shape after the refinement,and have excellent performance in numerical computation.%对于大型复杂的几何体，不可能仅通过一次算法自动剖分即得到高质量单元，剖分过程容易出现边界单元狭长、曲面内部单元尖锐等问题，由此，提出局部光顺优化算法。算法结合全局光顺方法以及局部网格拓扑结构优化方法的优点，避免了全局性优化算法计算量过大的缺陷，较传统优化算法，具有较好稳定性，通过实验验证，优化后的单元整体大小均匀、形状规整，在提高数值计算效率方面有较好表现。