摘要
提出了一种基于前沿推进法的平面区域三角化网格剖分方法 ,它具有算法简单、易于编程和浮点计算量少的特点 ,同时可以克服以往算法在角点处可能出现一个单元的3个节点全在边界上的缺点。剖分实例表明 :该方法的鲁棒性和普适性较好 ,剖分结果经过光滑后 ,可用于多连通域中传热和流动问题的控制容积积分法的求解。
A new triangulation method is presented for discretization of a planar multi connected domain. The method is a modified advancing front method which initializes the triangulation from the outer boundary and advances on the inner region based on three adjacent points. The proposed method is characterized by its simplicity and ease of implementation and can circumvent such undesireable situations such as the three vertices of an element are all on the boundary. Numerical grid generation examples demonstrate the feasibility and robustness of the proposed method.
出处
《清华大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2000年第12期90-93,共4页
Journal of Tsinghua University(Science and Technology)
基金
国家自然科学基金项目! (5 96 76 0 19)
国家重点基础研究发展规划项目! (G2 0 0 0 0 2 6 30 3)
