An unstructurid generation method based on the Delaunay triangulation is presented that is capable of generating stretched layers along surface lines while retaining control over maximum angles. The method requires only minimum user input in the form of a set of boundary vertices, the character of each boundary, the thickness of the stretched layer and the maximum aspect ratio desired. With a boundary discretization that reverts to isotropy at corners, a smooth transition to the triangular frontal process is found, and the high mesh quality of the isotropic part of the algorithm is retained.d The algorithm proves sufficiently robust for viscous layers around slid surfaces that interact at their outer edges where stretching values have decayed close to isotropy. For the isotropic vertex generation process, upper and lower angular bounds were derived for constant gradients of vertex spacing and confirmed with sample calculations. Furthermore, statistical measures show that only very few cells approach these bounds, whereas most of the cells exhibit values close to the smallest possible maximum angle and the largest possible minimum angle, and most vertices have the optimum vertex degree. As in the purely isotropic case, only minimum user input is required for the stretched grids. Besides the set of boundary vertices, information about the boundary character as well as the thickness of the stretched layer and the maximum aspect ratio is needed. All other information is generated by the algorithm.
Quality estimates and stretched meshes based on Delaunay triangulations
Qualitätsbewertungen und gestrecktes Netz basierend auf der Delaunay Dreiecksvernetzung
AIAA Journal ; 32 , 12 ; 2372-2379
1994
8 Seiten, 15 Bilder, 18 Quellen
Article (Journal)
English
Quality Estimates and Stretched Meshes Based on Delaunay Triangulations
Online Contents | 1994
|Matching Deformed Delaunay Triangulations
British Library Conference Proceedings | 1995
|