An ultralight geometry processing library for parallel mesh refinement

IF 2.9 3区 工程技术 Q2 ENGINEERING, MECHANICAL
Wang, Bohan, Chen, Bo, Yu, Kaixin, Xie, Lijun, Chen, Jianjun
{"title":"An ultralight geometry processing library for parallel mesh refinement","authors":"Wang, Bohan, Chen, Bo, Yu, Kaixin, Xie, Lijun, Chen, Jianjun","doi":"10.1186/s42774-021-00093-8","DOIUrl":null,"url":null,"abstract":"In applications such as parallel mesh refinement, it remains a challenging issue to ensure the refined surface respects the original Computer-Aided Design (CAD) model accurately. In this paper, an ultralight geometry processing library is developed to resolve this issue effectively and efficiently. Here, we say the kernel is ultralight because it has a very small set of data-structures and algorithms by comparison with industrial-level geometry kernels. Within the library, a simplified surface boundary representation (B-rep) and a radial edge structure are developed respectively to depict the geometry model and the surface mesh, plus hash tables that record the connections between the geometry model and the surface mesh. Based on these data structures, a set of efficient algorithms are developed, which initializes the connection tables, projects a point back to the original geometry, etc. With these data-structure and algorithmic infrastructures set up, the callings of eight well-designed Application Programming Interfaces (APIs) are powerful enough to enable the parallel mesh refinement algorithm outputs a mesh respecting the input CAD model accurately. Numerical experiments will be finally presented to evaluate the performance of the overall parallel mesh refinement algorithm and the algorithms in relation with the developed library.","PeriodicalId":33737,"journal":{"name":"Advances in Aerodynamics","volume":"120 5-6","pages":""},"PeriodicalIF":2.9000,"publicationDate":"2022-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Aerodynamics","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1186/s42774-021-00093-8","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, MECHANICAL","Score":null,"Total":0}
引用次数: 0

Abstract

In applications such as parallel mesh refinement, it remains a challenging issue to ensure the refined surface respects the original Computer-Aided Design (CAD) model accurately. In this paper, an ultralight geometry processing library is developed to resolve this issue effectively and efficiently. Here, we say the kernel is ultralight because it has a very small set of data-structures and algorithms by comparison with industrial-level geometry kernels. Within the library, a simplified surface boundary representation (B-rep) and a radial edge structure are developed respectively to depict the geometry model and the surface mesh, plus hash tables that record the connections between the geometry model and the surface mesh. Based on these data structures, a set of efficient algorithms are developed, which initializes the connection tables, projects a point back to the original geometry, etc. With these data-structure and algorithmic infrastructures set up, the callings of eight well-designed Application Programming Interfaces (APIs) are powerful enough to enable the parallel mesh refinement algorithm outputs a mesh respecting the input CAD model accurately. Numerical experiments will be finally presented to evaluate the performance of the overall parallel mesh refinement algorithm and the algorithms in relation with the developed library.
一个用于并行网格细化的超轻几何处理库
在并行网格精化等应用中,如何保证精化后的曲面符合计算机辅助设计(CAD)模型,一直是一个具有挑战性的问题。为了有效地解决这一问题,本文开发了一个超轻几何处理库。这里,我们说内核是超轻的,因为与工业级几何内核相比,它具有非常小的数据结构和算法集。在库中,分别开发了简化的表面边界表示(B-rep)和径向边缘结构来描述几何模型和表面网格,以及记录几何模型和表面网格之间连接的哈希表。基于这些数据结构,开发了一套高效的算法,用于初始化连接表、将点投影回原始几何等。有了这些数据结构和算法基础设施,八个精心设计的应用程序编程接口(api)的调用就足够强大,可以使并行网格细化算法准确地输出符合输入CAD模型的网格。最后将通过数值实验来评估整体并行网格细化算法的性能以及与所开发的库相关的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
4.50
自引率
4.30%
发文量
35
审稿时长
11 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信