Efficient unstructured quadrilateral mesh generation

This work is devoted to the description of an algorithm for automatic quadr ilateral mesh generation. The technique is based on a recursive decompositi on of the domain into quadrilateral elements. This automatically generates meshes composed entirely by quadrilaterals over complex geometries (there i s no need for a previous step where triangles are generated). A background mesh with the desired element sizes allows to obtain the preferred sizes an ywhere in the domain. The final mesh can be viewed as the optimal one given the objective function is defined. The recursive algorithm induces an effi cient data structure which optimizes the computer cost. Several examples ar e presented to show the efficiency of this algorithm. Copyright (C) 2000 Jo hn Wiley & Sons, Ltd.