纯虚拓扑理论与建模方法  

Theory and Modeling Method of Pure Virtual Topology

作　　者：丁展[1,2] 张三元 张春捷[2] Ding Zhan;Zhang Sanyuan;Zhang Chunjie(School of Software,Jinling Institute of Technology,Nanjing 211169;School of Computer Science ＆ Technology;Zhejiang University,Hangzhou 310027;3Livermore Software Technology Corporation,Dalian 116034)

机构地区：[1]金陵科技学院软件工程学院,南京211169 [2]利弗莫尔软件技术公司,大连116034 [3]浙江大学计算机科学与技术学院,杭州310027

出　　处：《计算机辅助设计与图形学学报》2018年第7期1366-1373,共8页Journal of Computer-Aided Design & Computer Graphics

基　　金：江苏省高校自然科学研究面上项目(15KJD520004);国家自然科学基金(61272304)

摘　　要：为了将复杂的B-rep模型有效地转换成可供有限元分析的壳网格,提出一种基于纯虚拓扑的建模方法.首先使用合并、分割、插入和收缩4种基本算子将B-rep模型转换成纯虚拓扑模型;之后利用基于约束列表的网格优化算法将纯虚拓扑模型自动划分成较为均匀的网格.实验结果表明,该方法可以快速、鲁棒地生成实际复杂模型的壳网格,网格质量均匀、有效,从而为后续有限元求解分析提供了良好的基础.To convert complex B-rep model to shell mesh for finite element analysis effectively, a modeling approach based on pure virtual topology（PVT） is presented. PVT modeling firstly uses four operators： Merge, Split, Insert and Collapse to convert B-rep model to PVT model. Then automatically mesh the PVT model by optimized meshing algorithm based on constraints list. Experiments show that this method can quickly and robustly generated well defined 2 D mesh for real complex model, and it builds solid fundamental for the following finite element analysis.

关 键 词：纯虚拓扑 B-REP 有限元分析 壳网格 网格划分 

分 类 号：TP391.72[自动化与计算机技术—计算机应用技术]