摘要
基于Delaunay三角化方法 ,给出了内部带有任意复杂特征约束的任意平面域的三角形网格生成方法。区域内部特征约束可以是点、直线、圆、圆弧、平面样条曲线以及由它们组合构成的封闭环或者不封闭环。
Based on Delaunay triangulation an algorithm is presented for generation triangle mesh over any planar domain which have complicated characteristic constraints.Charateritic constraints in a planar domain can be constructed by point,line,circle,arc,spline curves,open loops and closed loops which are made up of them. [
出处
《计算物理》
CSCD
北大核心
2000年第3期293-297,共5页
Chinese Journal of Computational Physics
基金
国家自然科学基金重点项目资助项目!(196 32 0 0 4)
关键词
平面区域
网格划分
DELAUNAY三角化
planar region
mesh generation
characteristic constraint
Delaunay triangulation
