ISSN:
0029-5981
Keywords:
Engineering
;
Engineering General
Source:
Wiley InterScience Backfile Collection 1832-2000
Topics:
Mathematics
,
Technology
Notes:
A procedure to generate 2D meshes of triangles in a quite general fashion allowing for local and selective mesh-refinement is presented and discussed. The grid generator is based on the iterative application of 4-triangles conforming mesh-refinement algorithms for triangulations, which are also introduced in this paper. These algorithms are modified versions of those proposed in Int. j. numer. methods eng., 20, 745-756 (1984), and they can be used for global refinement of a grid, as well as for local refinement. The grid generator works in the following way: given any initial coarse triangulation which properly defines the geometry of the problem, a set of user-defined refinement subregions Ri, i = 1,2,…, N, and an associated set of tolerance parameters hi, an irregular and conforming final triangulation is automatically constructed in such a way that the diameter of all the triangles contained in Ri is smaller than hi, i= 1,2,…, N. Moreover, all angles in the final triangulation are greater than or equal to half the smallest angle in the initial, coarse one. The refinement is propagated only to assure the conformity and smoothness of the grid, and consequently, the number of involved nodes will be minimized. The refinement of the final mesh will be determined by the subregions Ri and the parameters Ni and will be essentially independent of the initial coarse grid. The 4-triangles conforming mesh-refinement algorithms are presented and their properties discussed. The implementation of these techniques is discussed and examples of the application of the grid generator are given.
Additional Material:
8 Ill.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1002/nme.1620240710
Permalink
