Based On The Delaunay Algorithm Of Ruppert Unstructured Grid Improvements

This paper is basis on un-structured mesh generation algorithm proposed by Ruppert; I put forward two kinds of improved algorithms to the problem of Rupert's algorithm, and I have proved the convergence of the two algorithms. In the first improved algorithm: the algorithm used the thinking of Li.X.Y' algorithm, expand the selection of insertion point in sliver element and encroached subsegment; and to the processing of disposal all encroached subsegment have priority to sliver element. In the second improved algorithm: by defining criteria for judgment of encroached points and eroding the sliver element as the foundation of selection of insertion point; and proposed a new criterion of insertion in encroached subsegment, the criterion is base on avoiding to produce a small angle, that is, the new element tended to be an equilateral triangulation. The algorithm of eroding sliver element can decrease the processing of new sliver element and the insertion of point; the algorithm of eroding encroached subsegment can void to produce new sliver element to small angle problem.Finally, when model have small angle, algorithm isn't convergence. To this, I put forward solutions.