| 引用本文: | 陈欣,熊岳山.复杂平面区域的三角网格生成算法.[J].国防科技大学学报,2008,30(4):94-97.[点击复制] |
| CHEN Xin,XIONG YueShan.Triangular Mesh Generation over Arbitrary Two-dimensional Domain[J].Journal of National University of Defense Technology,2008,30(4):94-97[点击复制] |
|
| |
|
|
| 本文已被：浏览 6939次 下载 5840次 |
| 复杂平面区域的三角网格生成算法 |
| 陈欣1,2, 熊岳山1 |
|
(1.国防科技大学 计算机学院，湖南 长沙 410073;2.浙江师范大学 数理与信息工程学院，浙江 金华 321004)
|
| 摘要: |
| 为生成复杂平面区域的有限元网格，提出了基于网格细化的三角网格生成算法。该算法首先采用耳尖移除法对区域边界做三角划分，得到粗略的初始网格。提出Delaunay优化平分方法，根据网格密度细化初始网格，该网格细化方法结合最长边平分技术与Delaunay边交换技术，可有效提高内点生成与单元细分的质量。实验表明，基于Delaunay优化平分的三角网格生成算法可对任意平面域进行网格剖分，生成符合有限元计算要求的高质量三角网格。 |
| 关键词: 三角网格 网格生成 网格细化 Delaunay优化平分 |
| DOI： |
| 投稿日期：2007-12-29 |
| 基金项目:国家自然科学基金资助项目(60773022)；国家863计划资助项目(2007AA01Z313)；北京市自然科学基金资助项目(4062034) |
|
| Triangular Mesh Generation over Arbitrary Two-dimensional Domain |
| CHEN Xin1,2, XIONG YueShan1 |
|
(1.College of Computer, National Univ. of Defense Technology, Changsha 410073, China;2.School of Mathematics, Physics & Information Engineering, Zhejiang Normal Univ.， Jinhua 321004, China)
|
| Abstract: |
| A refinement-based triangular meshing algorithm is proposed to generate finite element meshes of arbitrary two-dimensional domains. The boundary is triangulated by the ear-removal method, constructing an initial mesh with coarse elements. To meet the pre-specified sizing requirement by refining the initial mesh, a novel mesh refinement method, Delaunay-optimized bisection, is presented. By combining global-longest-edge bisection with Delaunay edge swapping, well-shaped triangular elements are constructed. Meshing examples are presented along with mesh statistics, showing that the presented algorithm is capable of generating quality finite element meshes for arbitrary 2D domains. |
| Keywords: triangular mesh mesh generation mesh refinement delaunay-optimized bisection |
|
|
