Towards a more efficient dynamic mesh adaptation methodology for continuum discretization in complex engineering problems

A novel and efficient method of adaptive mesh generation, for dynamically adaptive unstructured grids, is proposed. A locally refined triangulation is constructed on a coarse background mesh, subdividing each triangle in the refinement region R into four congruent sub-triangles iteratively, by connecting edge midpoints, until triangles of a prescribed lengthscale are obtained. The unavoidable propagation outside the refinement region R is restricted to a single triangle in the coarse background mesh. The triangles, in the immediate vicinity of region R, are broken down using the concept of iterated function systems, widely used in fractal modeling, by recursive generation of sub-triangles with a gradation towards the region R triangles. A quantitative assessment of the present algorithm proves its superiority over other comparable models reported in the literature. The time cost of the algorithm is linear, and the method can be easily extended to three dimensions.