节点文献
二维任意平面三角形网格自动剖分的实现
Two dimension arbitrarily planer region automated trianglar mesh generation realized based on visual C++ language
【摘要】 基于波前推进法提出了一种针对任意平面区域生成三角形网格的全自动生成算法 .算法具有区域适应性强 ,边界网格质量高 ,自动化程度高的优点 .算法还包括了网格的拓扑优化和光滑处理 .由于使用了VisualC + +语言MFC类库进行网格剖分数据链表的管理 ,使得编程容易 ,整个程序简单实用 .最后 ,大量算例显示了算法的可靠性和适用性
【Abstract】 Based on the advancing front method, an automated triangular mesh generation algorithm for arbitrarily shaped planer region is presented in this paper. The proposed algorithm has the advantages of adaptation to complicate boundaries, high quality boundary mesh and full automation. Approaches such as topological refinement and smoothing are incorporated. The programming with Visual C++ is relatively simple by using MFC Library function to manage the list. At last, the application examples are included to demonstrate the capabilities and high reliability of algorithm.
【Key words】 automatic mesh generation; triangular mesh; advancing front method; MFC library;
- 【文献出处】 沈阳工业大学学报 ,Journal of Shenyang University of Technology , 编辑部邮箱 ,2002年03期
- 【分类号】TP311.52
- 【被引频次】13
- 【下载频次】318