摘要
为提高传统波前法(Advancing Front Method,AFM)的网格生成效率,利用多维搜索二叉树数据结构实现临近前沿和节点的快速查找,使整个网格生成的时间复杂度接近线性.针对周期曲面网格的生成,提出2种点修正算子,避免传统算法添加虚边界导致局部网格单元质量较差和虚边界计算复杂的问题.网格生成实例表明:多维搜索二叉树提高网格生成速度,引进点修正算子的波前法改善周期曲面网格质量.
To get better efficiency of mesh generation using Advancing Front Method （AFM）, the data structure of multi-dimensional binary search trees is used to implement fast query of the associative fronts and nodes, and the total meshing time complexity is nearly close to linearity. Two kinds of point- modification operations are proposed to construct mesh on periodic surfaces, with which the problems generated by constructing additional virtual boundaries are avoided, such as poor local mesh quality and complicated calculation on virtual boundaries. The examples of mesh generation indicate that, the multi- dimensional binary search trees can improve mesh generation efficiency, and the AFM with point- modification operations can improve the mesh quality of periodic surfaces.
出处
《计算机辅助工程》
2014年第4期69-75,共7页
Computer Aided Engineering
基金
国家自然科学基金(11172098)
湖南省自然科学基金(14JJ3148)
关键词
曲面网格生成
波前法
多维搜索二叉树
点修正算子
周期曲面
surface mesh generation
advancing front method
multi-dimensional binary search tree
point-modification operation
periodic surface
