Efficient Unstructured Mesh Generation by Means of Delaunay Triangulation and Bowyer-Watson Algorithm
暂无分享,去创建一个
This work is devoted to the description of an efficient unstructured mesh generation method entirely based on the Delaunay triangulation. The distinctive characteristic of the proposed method is that point positions and connections are computed simultaneously. This result is achieved by taking advantage of the sequential way in which the Bowyer-Watson algorithm computes the Delaunay triangulation. Two methods are proposed which have great geometrical flexibility, in that they allow us to treat domains of arbitrary shape and topology and to generate arbitrarily nonuniform meshes. The methods are computationally efficient and are applicable both in two and three dimensions.
[1] A Jameson,et al. CALCULATION OF IN VISCID TRANSONIC FLOW OVER A COMPLETE AIRCRAFT , 1986 .
[2] Timothy J. Baker,et al. Three dimensional mesh generation by triangulation of arbitrary point sets , 1987 .
[3] O. C. Zienkiewicz,et al. Adaptive remeshing for compressible flow computations , 1987 .
[4] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .