检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中国科学院计算机网络信息中心超级计算中心,北京100190 [2]中国科学院大学,北京100190
出 处:《计算机辅助设计与图形学学报》2016年第6期932-942,共11页Journal of Computer-Aided Design & Computer Graphics
基 金:国家"八六三"高技术研究发展计划(2012AA01A304;2015AA01A302);国家自然科学基金(91130019;91330206;11271350)
摘 要:针对二维并行约束Delaunay网格生成算法直接应用于三维条件下会导致人工边界产生过短边的问题,提出并实现了基于主从模式的三维并行约束Delaunay网格生成算法.首先对求解区域进行分解,通过交换人工边界面上的数据解决子区域间网格一致性问题;其次为每个人工边界面选定主从子区域,由主子区域产生边界面网格并发送,从子区域负责接收;最后采用贪心算法平衡各个子区域的通信负载,得到算法效率的提升.实验结果表明,该算法可以大规模并行生成边界一致四面体网格,具有较好的并行效率,并能够保证最终的网格质量.In order to avoid generating extremely short edges on the artificial boundaries while applying the 2D Parallel Constrained Delaunay Meshing (PCDM) algorithm directly into 3D conditions, this paper proposes a 3D PCDM algorithm based on master-slave model. First of all, the domain is decomposed into several sub-domains and the mesh consistency is maintained by exchanging data on the artificial boundaries. Then the master and slave sub-domains are chosen for each artificial boundary. The master sub-domains send the generated boundary meshes and the slave ones receive them simultaneously. Finally, cupidity arithmetic is used to balance the communication load of the sub-domains, which leads to the improvement of efficiency. The experimental results show that the proposed algorithm can generate large-scale tetrahedral elements with conforming mesh along artificial boundaries in parallel, and can also provide a good parallel efficiency with the guarantee of mesh quality.
关 键 词:网格生成 并行计算 约束Delaunay算法 松耦合方法 边界一致
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.222.226.47