基于剪挖操作的三角形网格自动生成

Triangular Mesh Generation Based on Trimming Digging Operations

本文在系统比较了现有的几种主要有限元网格自动生成算法，即映射法、Ｄｅｌａｕｎａｙ方法、推进网阵法的基础上，给出了基于剪挖操作的直接网格自动生成算法。此算法具有全自动生成的特点，无需象Ｄｅｌａｕｎａｙ方法那样先配置内部节点，也无需象映射法那样经过复杂的数学变换。灵活性与可靠性都明显优于它们。剪挖顺序基于优先级，本文还给出了具体的基于权平均的优先级函数。本网格自动生成方法是我们注塑成型ＣＡＥ／ＣＡＤ软件ＷＰ－Ｆｌｏｗ的一部分，它同推进网阵方法组成了ＷＰ－Ｆｌｏｗ的两种主要网格自动生成算法。

Abstract In this article, we systematically compared the main popular automatic grid generarion methods, i.e., mapping method, Delaunary method, advancing front approach. An efficient method based on the trimming digging operations is presented in this paper. The trimming digging operation sequences depend on a priority function which is compoed of edge length ratio, small adjacent edge length, and boundary angle. The technique provided in this paper has been applied to injection mold filling analysis software WP Flow.