This work is 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 elements. This automatically generates meshes composed entirely by quadrilaterals over complex geometries (there is no 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 is defined. The recursive algorithm induces an efficient data structure which optimizes the computer cost. Several examples are presented to show the efficiency of this algorithm.
CitationSarrate, J.; Huerta, A. Efficient unstructured quadrilateral mesh generation. "International journal for numerical methods in engineering", Setembre 2000, vol. 49, núm. 10, The definitive version is available at http://www3.interscience.wiley.com/journal/73504222/abstract, p. 1327-1350.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com