高级检索

任意平面域渐变三角形网格的自动划分

AUTOMATIC TRIANGULATION OF GRADED MESH FOR ARBITRARY PLANAR DOMAIN

  • 摘要: 结合前沿生成法和Delaunay三角化方法的优点,利用节点间距函数来控制区域内网格尺寸变化.并优先处理前沿上的最长边,尽可能在局部生成边长逐渐减小的Delaunay三角形,最终实现区域内网格的疏密过渡.

     

    Abstract: Using the node space function to control the changes of element size,this paper integrates the method of advancing front and the Delaunay triangulation algorithm.The longest segment of generation front is preferably dealt with.The Delaunay triangulations with decreasing edge length are generated step by step and a smooth graded triangular mesh is constructed.

     

/

返回文章
返回