Efficient unstructured quadrilateral mesh generation
Efficient unstructured quadrilateral mesh generation
复制标题
DOI：
10.1002/1097-0207(20001210)49:10
复制
发表时间：
2000-12
影响因子：
2.9
通讯作者：
J. Sarrate;A. Huerta
中科院分区：
文献类型：
--
作者：
J. Sarrate;A. Huerta
本文介绍了一种四边形网格自动生成算法。该技术是基于一个递归分解的域成四边形元素。这将自动生成完全由复杂几何体上的四边形组成的网格（不需要生成三角形的前一步）。具有所需元素大小的背景网格允许在域中的任何位置获得优选大小。在给定目标函数的情况下，最终的网格可以被视为最优网格。递归算法引入了一种有效的数据结构，优化了计算机成本。最后给出了几个算例，证明了该算法的有效性.版权所有© 2000约翰威利父子有限公司。
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. Copyright © 2000 John Wiley & Sons, Ltd.