<p>An efficient and robust unstructured quad-dominated surface mesh generation approach based on grid-based and Delauany techniques is proposed. The proposed method integrates the advantages of both the grid-based algorithm and the Delauany triangulation algorithm, aiming to address the issue of boundary matching inherent in traditional grid-based method. The meshing process combines aspects of well-established meshing techniques, but also incorporates some innovative and efficient procedures. The refinement structure is built by taking into account mesh size, boundary curvature, and other geometry features. To produce the core mesh efficiently, a fast intersection algorithm between cell edges and the geometric boundary has been developed, which enhances the effectiveness of intersection calculations. The geometry-based method combined with Delauany and Q-morph techniques is employed to match the boundaries of the core mesh without considering any meshing templates. Experimental results demonstrate that the ultimate mesh is predominantly made up of quadrilateral elements, complemented by a few triangular elements for auxiliary purposes, which verified the validity and robustness of the proposed method.</p>

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

An efficient and robust unstructured quad-dominated mesh generation method based on the grid-based and Delauany techniques

  • Baotao Chi,
  • Xianze Yu,
  • Qianjian Guo,
  • Xiancheng Zhang,
  • Jingquan Hao,
  • Wei Yuan

摘要

An efficient and robust unstructured quad-dominated surface mesh generation approach based on grid-based and Delauany techniques is proposed. The proposed method integrates the advantages of both the grid-based algorithm and the Delauany triangulation algorithm, aiming to address the issue of boundary matching inherent in traditional grid-based method. The meshing process combines aspects of well-established meshing techniques, but also incorporates some innovative and efficient procedures. The refinement structure is built by taking into account mesh size, boundary curvature, and other geometry features. To produce the core mesh efficiently, a fast intersection algorithm between cell edges and the geometric boundary has been developed, which enhances the effectiveness of intersection calculations. The geometry-based method combined with Delauany and Q-morph techniques is employed to match the boundaries of the core mesh without considering any meshing templates. Experimental results demonstrate that the ultimate mesh is predominantly made up of quadrilateral elements, complemented by a few triangular elements for auxiliary purposes, which verified the validity and robustness of the proposed method.