首页 | 官方网站   微博 | 高级检索  
     

二维任意平面三角形网格自动剖分的实现
引用本文:李博,谢德馨,白保东.二维任意平面三角形网格自动剖分的实现[J].沈阳工业大学学报,2002,24(3):196-199.
作者姓名:李博  谢德馨  白保东
作者单位:沈阳工业大学,电气工程学院,辽宁,沈阳,110023
摘    要:基于波前推进法提出了一种针对任意平面区域生成三角形网格的全自动生成算法,算法具有区域适应性强,边界网格质量高,自动化程度高的优点,算法还包括了网格的拓扑优化和光滑处理,由于使用Visual C 语言MFC类库进行网格剖分数据链表的管理,使得编程容易,整个程序简单实用,最后,大量算例显示了算法的可靠性和适用性。

关 键 词:网格自动生成  三角化剖分  波前推进法  MFC类库
文章编号:1000-1646(2002)03-0196-04
修稿时间:2001年4月18日

Two dimension arbitrarily planer region automated trianglar mesh generation realized based on visual C++ language
LI Bo,XIE De-xin,BAI Bao-dong.Two dimension arbitrarily planer region automated trianglar mesh generation realized based on visual C++ language[J].Journal of Shenyang University of Technology,2002,24(3):196-199.
Authors:LI Bo  XIE De-xin  BAI Bao-dong
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.
Keywords:automatic mesh generation  triangular mesh  advancing front method  MFC library
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号