期刊文献+

Automatic Mesh Generation on a Regular Background Grid

Automatic mesh generation on a regular background grid
原文传递
导出
摘要 This paper presents an automatic mesh generation procedure on a 2D domain based on a regular background grid. The idea is to devise a robust mesh generation scheme with equal emphasis on quality and efficiency. Instead of using a traditional regular rectangular grid, a mesh of equilateral triangles is employed to ensure triangular element of the best quality will be preserved in the interior of the domain. As for the boundary, it is to be generated by a node/segment insertion process. Nodes are inserted into the background mesh one by one following the sequence of the domain boundary. The local structure of the mesh is modified based on the Delaunay criterion with the introduction of each node. Those boundary segments, which are not produced in the phase of node insertion, will be recovered through a systematic element swap process. Two theorems will be presented and proved to set up the theoretical basic of the boundary recovery part. Examples will be presented to demonstrate the robustness and the quality of the mesh generated by the proposed technique. This paper presents an automatic mesh generation procedure on a 2D domain based on a regular background grid. The idea is to devise a robust mesh generation scheme with equal emphasis on quality and efficiency. Instead of using a traditional regular rectangular grid, a mesh of equilateral triangles is employed to ensure triangular element of the best quality will be preserved in the interior of the domain. As for the boundary, it is to be generated by a node/segment insertion process. Nodes are inserted into the background mesh one by one following the sequence of the domain boundary. The local structure of the mesh is modified based on the Delaunay criterion with the introduction of each node. Those boundary segments, which are not produced in the phase of node insertion, will be recovered through a systematic element swap process. Two theorems will be presented and proved to set up the theoretical basic of the boundary recovery part. Examples will be presented to demonstrate the robustness and the quality of the mesh generated by the proposed technique.
作者 LO S.H 刘剑飞
出处 《Journal of Computer Science & Technology》 SCIE EI CSCD 2002年第6期882-887,共6页 计算机科学技术学报(英文版)
关键词 mesh generation background grid triangular mesh boundary recovery mesh generation background grid triangular mesh boundary recovery
  • 相关文献

参考文献16

  • 1Borouchaki Houman, Paul Louis George. Aspects of 2-D Delaunay mesh generation. International Journal for Numerical Methods in Engineering, John Wiley L: Sons, 1997, 40: 1957-1975.
  • 2Cavendish, James C. Automatic triangulation of arbitrary planar domains for the finite element method. International Journal for Numerical Methods in Engineering, John Wiley & Sons, 1974, 8: 679-696.
  • 3Sadek E A. A scheme for the automatic generation of triangular finite elements. Int. J. Numer. Methods Eng.,1980, 15:1813-1822.
  • 4Shaw R D, Pitchen R G. Modification to Suhara-Fukuda method of network generation. Int. J. Numer. Methods Eng., 1978, 12:93-99.
  • 5Lo S H. A'new mesh generation scheme for arbitrary planar domains. Int. J. Numer. Methods Eng., 1985, 21:1403-1426.
  • 6Lo S H. Delaunay triangulation of non-convex planar domains. Int. J. Numer. Methods Eng., 1989, 28:2695 2707.
  • 7Jin H, Wiberg N E. Two-dimension mesh generation, adaptive remeshing and refinement. Int. J. Numer. Methods Eng., 1990, 29:1501-1526.
  • 8Fortune S. Numerical stability of algorithms for 2d Delauuay triangulations. Int. J. Cornput. Geometry Appl.,1995, 5(1 2): 193 213.
  • 9Blacker T D, Stephenson M B. Paving: A new approach to automated quadrilateral mesh generation. Int. J.Numer. Methods Eng., 1991, 32:811-847.
  • 10Kwok W, Haghighi K, Lang E. An efficient structure for the advancing-front triangular mesh generation technique.Commun. Numer. Methods Eng., 1995, 11: 465-473.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部