Fast algorithm for extracting domains and regions from three-dimensional triangular surface meshes

IF 3 3区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Sebastian Bohm, Erich Runge
{"title":"Fast algorithm for extracting domains and regions from three-dimensional triangular surface meshes","authors":"Sebastian Bohm,&nbsp;Erich Runge","doi":"10.1016/j.cad.2024.103824","DOIUrl":null,"url":null,"abstract":"<div><div>Correct mesh handling and in particular domain extraction is an important step of many simulation workflows. In the boundary element method, for example, only the surfaces of arbitrarily shaped domains have to be meshed. Here, an algorithm is presented that extracts all distinct spatial regions and domains from a given non-manifold three-dimensional surface triangulation without the need for a volume mesh. Only the coordinates of the mesh vertices and the connectivity matrix of the triangulation need to be given. The process is robust, easy to implement, and efficient. No geometric features such as edges or faces need to be detected or specified for the method to work. Thus, the method is suitable for mesh formats that do not contain information about the geometry partitioning. The algorithm is presented in detail, test cases are discussed, and an exemplary implementation is given.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"180 ","pages":"Article 103824"},"PeriodicalIF":3.0000,"publicationDate":"2024-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer-Aided Design","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0010448524001519","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

Correct mesh handling and in particular domain extraction is an important step of many simulation workflows. In the boundary element method, for example, only the surfaces of arbitrarily shaped domains have to be meshed. Here, an algorithm is presented that extracts all distinct spatial regions and domains from a given non-manifold three-dimensional surface triangulation without the need for a volume mesh. Only the coordinates of the mesh vertices and the connectivity matrix of the triangulation need to be given. The process is robust, easy to implement, and efficient. No geometric features such as edges or faces need to be detected or specified for the method to work. Thus, the method is suitable for mesh formats that do not contain information about the geometry partitioning. The algorithm is presented in detail, test cases are discussed, and an exemplary implementation is given.

Abstract Image

从三维三角形曲面网格中提取域和区域的快速算法
正确的网格处理,特别是域提取,是许多仿真工作流程的重要步骤。例如,在边界元方法中,只有任意形状的域的表面需要网格化。这里介绍一种算法,它可以从给定的非平面三维曲面三角剖分中提取所有不同的空间区域和域,而无需体积网格。只需给出网格顶点的坐标和三角形的连接矩阵。该过程稳健、易于实现且高效。该方法无需检测或指定边或面等几何特征。因此,该方法适用于不包含几何分割信息的网格格式。本文详细介绍了该算法,讨论了测试案例,并给出了示例实现方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computer-Aided Design
Computer-Aided Design 工程技术-计算机:软件工程
CiteScore
5.50
自引率
4.70%
发文量
117
审稿时长
4.2 months
期刊介绍: Computer-Aided Design is a leading international journal that provides academia and industry with key papers on research and developments in the application of computers to design. Computer-Aided Design invites papers reporting new research, as well as novel or particularly significant applications, within a wide range of topics, spanning all stages of design process from concept creation to manufacture and beyond.
×
引用
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学术官方微信