摘要
通过对非结构化网格生成的Ｄｅｌａｕｎａｙ 三角形划分方法进行分析，对该算法进行了优化设计，提出了一种用动态数据结构———双向链表来实现网格生成的高速、有效算法．该算法同常规算法相比，不仅解决了程序通用性设计的问题，生成的网格质量较好，而且网格生成所需的时间大大缩短，仅为常规算法的１／５ ．该算法不仅适用于各种复杂的计算区域，而且能非常方便地实现局部加密．
The Delaunay triangulation method for the generation of unstructured grid is analyzed and an efficient algorithm is developed by optimization. The dynamic data structure of double link list is used to speed up the process of grid generation. With this method, the general design purpose of the program is achieved and time needed for the grid generation is shortened considerably. Only one fifth of the time is needed in the new approach. At the same time the shape of the grid is quite well. This algorithm can be applied to treat arbitrary complicated domain and the grid can be refined easily.
出处
《西安交通大学学报》
EI
CAS
CSCD
北大核心
2000年第1期18-21,29,共5页
Journal of Xi'an Jiaotong University
基金
国家教委跨世纪人才培养计划基金!教技厅[1997]2 号
霍英东高校青年教师基金
