| 结点连元法的一种改进算法 |
| |
| 引用本文： | 杨长伟,孙立镌.结点连元法的一种改进算法[J].哈尔滨理工大学学报,2000,5(5):97-100. |
| |
| 作者姓名： | 杨长伟 孙立镌 |
| |
| 作者单位： | 哈尔滨理工大学,计算机与控制学院,黑龙江,哈尔滨,150080 |
| |
| 摘 要： | 针对S．H．Lo的非随机布点算法的缺陷，采用圆切除法对其改进，使得结点分布更为合理，并在此基础上给出一种有限元网格剖分算法－Watson算法的改进算法。该算法实现简单，生成的单元质量好，适用于任意形状的平面域。
|
| 关 键 词： | 有限元 网格剖分 结点连元法 Delaunay剖分原理 算法 |
| 文章编号： | 1007-2683(2000)05-0097-04 |
An Improved Algorithm of Node Connection Approach |
| |
| YANG Chang-wei,SUN Li-quan.An Improved Algorithm of Node Connection Approach[J].Journal of Harbin University of Science and Technology,2000,5(5):97-100. |
| |
| Authors: | YANG Chang-wei SUN Li-quan |
| |
| Abstract: | Larger blank regions will form after deleting inner nodes near the border in the nonrandom point - distributing algorithm of S. H. Lo. So some improvements by using circular cutting-off method are presented, by which the nodes distribution can be made more rational. Based on it, an improved algorithm of Node connection approach is proposed. Which can be easily realized and generate high quality elements. It is available for arbitrary plane regions. |
| |
| Keywords: | finite element mesh generation Node connection approach delaunay dividing principle |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
