Scholarlink

Abstract <p>Mesh generation is a special and pivotal task in the FEM solution process. The employment of lower-order (linear) quadrilateral finite elements often necessitates a greater number of elements than higher-order quadrilateral elements in meshing. FEM has two sorts of higher-order, namely Lagrange and serendipity-type quadrilateral elements. The use of such higher-order quadrilateral elements in meshing needs the use of an efficient algorithm. Furthermore, domain (convex, concave, or a combination of the two) discretization emphasizes the requirement for a generic approach. This article endeavors to present an efficient generic algorithm for meshing such domains (convex or concave) with (lower-, higher-order Lagrange, or serendipity-type) quadrilateral finite elements. First, we devise an algorithm to partition a given domain into a minimum number of convex subdomains, meshing each of them using (lower-, higher-order) quadrilaterals, and then further subdivide each quadrilateral into other quadrilaterals. This refining procedure continues until a fine mesh is formed. The algorithm requires only the type and order of the elements to mesh the domain with a polygonal boundary, whereas for meshing the domain with curved boundaries, equations of curves are also needed to be included in addition to the type and order of the elements. Then, after the final refinements, it prepares all elements’ data, e.g., node numbers, nodal coordinates, and connectivity of all quadrilaterals used in the mesh. Finally, for clarity and reference, the application of the algorithm is shown by meshing different domains using lower- and higher-order (Lagrange and serendipity type) quadrilateral elements.</p> Highlights <p>• Developed an efficient generic algorithm for meshing arbitrary domains.</p> <p>• The algorithm is suitable for meshing domain (convex, concave, and a combination of both) using higher-order serendipity as well as Lagrange-type quadrilateral elements.</p> <p>• The application of the algorithm substantiated by meshing different domains.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Generic Algorithm for Meshing Arbitrary (Convex, Concave) Domain with Polygonal or Curved Boundaries by Quadrilateral Finite Elements

  • 期刊论文

  • 发表日期：

    2025年11月27日

查看全文
  • Syeda Sabikun Nahar,
  • Rina Paul,
  • Md. Shajedul Karim

摘要

Abstract

Mesh generation is a special and pivotal task in the FEM solution process. The employment of lower-order (linear) quadrilateral finite elements often necessitates a greater number of elements than higher-order quadrilateral elements in meshing. FEM has two sorts of higher-order, namely Lagrange and serendipity-type quadrilateral elements. The use of such higher-order quadrilateral elements in meshing needs the use of an efficient algorithm. Furthermore, domain (convex, concave, or a combination of the two) discretization emphasizes the requirement for a generic approach. This article endeavors to present an efficient generic algorithm for meshing such domains (convex or concave) with (lower-, higher-order Lagrange, or serendipity-type) quadrilateral finite elements. First, we devise an algorithm to partition a given domain into a minimum number of convex subdomains, meshing each of them using (lower-, higher-order) quadrilaterals, and then further subdivide each quadrilateral into other quadrilaterals. This refining procedure continues until a fine mesh is formed. The algorithm requires only the type and order of the elements to mesh the domain with a polygonal boundary, whereas for meshing the domain with curved boundaries, equations of curves are also needed to be included in addition to the type and order of the elements. Then, after the final refinements, it prepares all elements’ data, e.g., node numbers, nodal coordinates, and connectivity of all quadrilaterals used in the mesh. Finally, for clarity and reference, the application of the algorithm is shown by meshing different domains using lower- and higher-order (Lagrange and serendipity type) quadrilateral elements.

Highlights

• Developed an efficient generic algorithm for meshing arbitrary domains.

• The algorithm is suitable for meshing domain (convex, concave, and a combination of both) using higher-order serendipity as well as Lagrange-type quadrilateral elements.

• The application of the algorithm substantiated by meshing different domains.