摘要
针对有限元前置处理中二维复杂域四边形网格自动剖分问题,对四叉树网格剖分算法进行了研究。描述了四叉树网格的数据结构及其递归生成过程;提出基于计算机图形学的网格黑白性判断算法;给出两种边界网格处理的修正方法,并对这两种修正方法进行了比较;利用四叉树数据结构的特点实现对网格遍历、查找、插入等操作,并根据最近共同祖先法完成四叉树网格邻域的查询。结果表明:采用该方法可以实现有限元网格全自动剖分,网格生成只依赖于二维域的几何特征,对复杂边界的适应性强,生成的网格域内全部为四边形,只在域边界处出现少量三角形网格,具有较高的质量;网格生成、遍历、查找等数据操作效率高、时间短。
The arithmetic of quadtree mesh generation was studied in order to solve the problem of the finite element automatic quadrilateral mesh generation for a two dimensional complex region. The data structure and recursion generat ion of quadtree mesh was described, and the method of black-white property judgm ent of mesh based on computer graphics was presented. Two modified methods of bo undary-mesh were given and compared. The operation of mesh such as ordering, finding and inserting was carried out according...
出处
《中国机械工程》
EI
CAS
CSCD
北大核心
2006年第S1期312-314,326,共4页
China Mechanical Engineering
关键词
非结构网格
四边形网格
网格生成
四叉树
unstructured mesh
quadrilateral mesh
mesh generation
quadtree
