In this paper, we begin by recalling an adaptive mesh generation method governed by isotropic and anisotropic discrete metric maps, by means of the generation of a unit mesh with respect to a Riemannian structure. We propose then an automatic triangular to quadrilateral mesh conversion scheme, which
Efficient unstructured quadrilateral mesh generation
β Scribed by Josep Sarrate; Antonio Huerta
- Publisher
- John Wiley and Sons
- Year
- 2000
- Tongue
- English
- Weight
- 363 KB
- Volume
- 49
- Category
- Article
- ISSN
- 0029-5981
No coin nor oath required. For personal study only.
β¦ Synopsis
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 ΓΏnal mesh can be viewed as the optimal one given the objective function is deΓΏned. The recursive algorithm induces an e cient data structure which optimizes the computer cost. Several examples are presented to show the e ciency of this algorithm.
π SIMILAR VOLUMES
Mesh smoothing is demonstrated to be an e ective means of copying, morphing, and sweeping unstructured quadrilateral surface meshes from a source surface to a target surface. Construction of the smoother in a particular way guarantees that the target mesh will be a 'copy' of the source mesh, provide