多源多目标扫掠体的全六面体网格自动生成算法  

Automatic Hexahedral Mesh Generation Algorithm for Many-to-Many Sweep Volumes

作　　者：肖周芳[1] 陈建军[1] 曹建[1] 朱朝艳[1,2] 郑耀[1] 

机构地区：[1]浙江大学航空航天学院工程与科学计算研究中心,杭州310027 [2]浙江大学宁波理工学院,宁波315100

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

基　　金：国家自然科学基金(11172267;10872182);浙江省自然科学基金(Y1110038;Y607429);中央高校基本科研业务费专项资金(2009QNA4037);浙江省钱江人才计划项目(2010R10004);国家科技支撑计划项目(2009BAG12A01-C02);国家水体污染控制与治理科技重大专项(2009ZX07424-001)

摘　　要：为实现多源多目标扫掠体六面体网格生成,提出针对该类形体的全六面体网格自动生成算法.该算法结合虚面和虚拟分解算法,将多源多目标扫掠体自动分解为多个多源扫掠子体;再采用多源扫掠网格生成方法生成各子体网格,整体网格则由各子体网格自动组合而成.文中给出了完整的虚拟分解算法,在虚拟分解流程中的"压印"环节利用改进的边界约束Delaunay三角化方法统一处理各类情形,避免了传统算法复杂的分类讨论.最后给出多个网格实例及其网格质量数据,验证了文中算法的实用性.An automatic hexahedral mesh generation algorithm for many-to-many sweep volumes is presented in this paper. By means of virtual decomposition, a many-to-many sweep volume is automatically decomposed into several many-to-one sweep sub-volumes. The sub-volumes are meshed by a previously proposed many-to-one sweep method, and the mesh for the many-to-many volume is generated by combining all of the sub-volume meshes. The virtual decomposition process for many-to- many sweep volume is the key for the success of the mesh generation algorithm, and this is focused in this study. Moreover, a novel procedure for imprinting target loops onto source loops is proposed to make them match in topology. The imprint procedures proposed in previous studies need discuss various cases to ensure robustness, thus suffer heavy coding efforts in practice. The new imprinting procedure is based on an enhanced boundary constrained Delaunay triangulation algorithm. It is conceptually simpler and contains no discussions on various cases that are essential to the previous procedures. Finally, two mesh examples and their quality data are presented to validate the efficiency and effectiveness of the proposed algorithm.

关 键 词：六面体网格 网格生成 扫掠 多源多目标 压印 

分 类 号：O242.21[理学—计算数学]