检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:曹杰[1] 赵铭伟 余飞[1] 昌继海[1] 关振群[1] Cao Jie;Zhao Mingwei;Yu Fei;Chang Jihai;Guan Zhenqun(State Key Laboratory of Structural Analysis for Industrial Equipment,Department of Engineering Mechanics,Dalian University of Technology,Dalian 116024)
机构地区:[1]大连理工大学工程力学系工业装备结构分析国家重点实验室,大连116024
出 处:《计算机辅助设计与图形学学报》2020年第8期1199-1207,共9页Journal of Computer-Aided Design & Computer Graphics
基 金:国家自然科学基金(10872040,11272074);国家科技重大专项(2011ZX02403)。
摘 要:为了提高复杂3D外形的边界层网格生成速度,提出一种基于离散中轴面的前沿分块层进算法.以闭合的边界三角形网格作为输入,在内部生成只含边界点的约束Delaunay三角化背景网格,聚集所有四面体的外心构成离散的中轴面.根据边界面片离中轴面的距离,将边界面片分为2类:快速推进的开阔区域面片和逐层推进的狭窄区域面片.在Intel Xeon X5650 CPU的单核上对NASA通用研究模型的边界层网格剖分结果表明,该算法的剖分效率是传统层进法或膨胀法的10倍以上,且完成106量级边界面片的分块只用了若干秒.To accelerate boundary layer meshing for 3D complex configurations,an advancing divided-layer method based on a discrete medial surface is presented.For a given surface mesh bounding an arbitrary field,a tetrahedral background mesh only containing boundary nodes is generated by a constrained Delaunay triangulation method,and a discrete medial surface is created with the circumscribed sphere centers of all tetrahedrons.According to the distance from the discrete medial surface,boundary facets are divided into two categories:the open area facets with rapid advance and the narrow area facets with standard layer-by-layer advance.One of boundary layer meshes was generated on the NASA common research model in a single core of an Intel Xeon X5650 CPU.The result shows that the proposed method is over ten times faster than the conventional advancing layer method or the inflating method,and dividing millions of boundary facets only consumes a few seconds.
关 键 词:边界层网格 层进法 中轴面 约束DELAUNAY三角化
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.44