Efficient unstructured quadrilateral meshes preserving the prescribed element size

Abstract

This work devoted to the description of an algorithm for automatic quadrilateral mesh generation. The technique is based on a recursive decomposition of the domain into quadrilateral over complex geometries (there is not need for a previous step where triangles are generated). A background mesh with the desired element sizes allows to obtain the preferred sizes anywhere in the domain. The final mesh can be viewed as the optimal one given the objective function defined. The recursive algorithm induces an efficient data structure which optimizes the computer cost. Several examples are presents to show the efficiency of this algorithm