摘要
基于Delaunay三角化方法和前沿生成方法,给出了具有任意内部特征的平面域变密度三角形网格生成方法。针对不同的内部特征,可任意设定其网格尺寸,通过加权平均,有效地控制网格的尺寸变化,最终实现了网格的疏密光滑过渡。
Based on the Delaunay triangulation method and the advancing front method, an algorithm for graded triangular mesh generation on planar domains with arbitrary internal characteristic constraints is presented. According to the different internal characteristic constraints, the mesh siges can be arbitrarily set. The changing of mesh sizes can be controlled effectively by weighted averaging, so that a smooth graded triangular mesh is achieved.
出处
《计算机应用与软件》
CSCD
北大核心
2003年第3期50-51,共2页
Computer Applications and Software
