A complex model decomposition algorithm based on 3D frame fields and features

IF 1.5 4区 工程技术 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Chengpeng Zhang, Zhihua Yu, Jimin Shi, Yu Li, Wenqiang Xu, Zheyi Guo, Hongshi Zhang, Zhongyuan Zhu, Sheng Qiang
{"title":"A complex model decomposition algorithm based on 3D frame fields and features","authors":"Chengpeng Zhang, Zhihua Yu, Jimin Shi, Yu Li, Wenqiang Xu, Zheyi Guo, Hongshi Zhang, Zhongyuan Zhu, Sheng Qiang","doi":"10.1108/ec-01-2023-0037","DOIUrl":null,"url":null,"abstract":"<h3>Purpose</h3>\n<p>Hexahedral meshing is one of the most important steps in performing an accurate simulation using the finite element analysis (FEA). However, the current hexahedral meshing method in the industry is a nonautomatic and inefficient method, i.e. manually decomposing the model into suitable blocks and obtaining the hexahedral mesh from these blocks by mapping or sweeping algorithms. The purpose of this paper is to propose an almost automatic decomposition algorithm based on the 3D frame field and model features to replace the traditional time-consuming and laborious manual decomposition method.</p><!--/ Abstract__block -->\n<h3>Design/methodology/approach</h3>\n<p>The proposed algorithm is based on the 3D frame field and features, where features are used to construct feature-cutting surfaces and the 3D frame field is used to construct singular-cutting surfaces. The feature-cutting surfaces constructed from concave features first reduce the complexity of the model and decompose it into some coarse blocks. Then, an improved 3D frame field algorithm is performed on these coarse blocks to extract the singular structure and construct singular-cutting surfaces to further decompose the coarse blocks. In most modeling examples, the proposed algorithm uses both types of cutting surfaces to decompose models fully automatically. In a few examples with special requirements for hexahedral meshes, the algorithm requires manual input of some user-defined cutting surfaces and constructs different singular-cutting surfaces to ensure the effectiveness of the decomposition.</p><!--/ Abstract__block -->\n<h3>Findings</h3>\n<p>Benefiting from the feature decomposition and the 3D frame field algorithm, the output blocks of the proposed algorithm have no inner singular structure and are suitable for the mapping or sweeping algorithm. The introduction of internal constraints makes 3D frame field generation more robust in this paper, and it can automatically correct some invalid 3–5 singular structures. In a few examples with special requirements, the proposed algorithm successfully generates valid blocks even though the singular structure of the model is modified by user-defined cutting surfaces.</p><!--/ Abstract__block -->\n<h3>Originality/value</h3>\n<p>The proposed algorithm takes the advantage of feature decomposition and the 3D frame field to generate suitable blocks for a mapping or sweeping algorithm, which saves a lot of simulation time and requires less experience. The user-defined cutting surfaces enable the creation of special hexahedral meshes, which was difficult with previous algorithms. An improved 3D frame field generation method is proposed to correct some invalid singular structures and improve the robustness of the previous methods.</p><!--/ Abstract__block -->","PeriodicalId":50522,"journal":{"name":"Engineering Computations","volume":null,"pages":null},"PeriodicalIF":1.5000,"publicationDate":"2024-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering Computations","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1108/ec-01-2023-0037","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Purpose

Hexahedral meshing is one of the most important steps in performing an accurate simulation using the finite element analysis (FEA). However, the current hexahedral meshing method in the industry is a nonautomatic and inefficient method, i.e. manually decomposing the model into suitable blocks and obtaining the hexahedral mesh from these blocks by mapping or sweeping algorithms. The purpose of this paper is to propose an almost automatic decomposition algorithm based on the 3D frame field and model features to replace the traditional time-consuming and laborious manual decomposition method.

Design/methodology/approach

The proposed algorithm is based on the 3D frame field and features, where features are used to construct feature-cutting surfaces and the 3D frame field is used to construct singular-cutting surfaces. The feature-cutting surfaces constructed from concave features first reduce the complexity of the model and decompose it into some coarse blocks. Then, an improved 3D frame field algorithm is performed on these coarse blocks to extract the singular structure and construct singular-cutting surfaces to further decompose the coarse blocks. In most modeling examples, the proposed algorithm uses both types of cutting surfaces to decompose models fully automatically. In a few examples with special requirements for hexahedral meshes, the algorithm requires manual input of some user-defined cutting surfaces and constructs different singular-cutting surfaces to ensure the effectiveness of the decomposition.

Findings

Benefiting from the feature decomposition and the 3D frame field algorithm, the output blocks of the proposed algorithm have no inner singular structure and are suitable for the mapping or sweeping algorithm. The introduction of internal constraints makes 3D frame field generation more robust in this paper, and it can automatically correct some invalid 3–5 singular structures. In a few examples with special requirements, the proposed algorithm successfully generates valid blocks even though the singular structure of the model is modified by user-defined cutting surfaces.

Originality/value

The proposed algorithm takes the advantage of feature decomposition and the 3D frame field to generate suitable blocks for a mapping or sweeping algorithm, which saves a lot of simulation time and requires less experience. The user-defined cutting surfaces enable the creation of special hexahedral meshes, which was difficult with previous algorithms. An improved 3D frame field generation method is proposed to correct some invalid singular structures and improve the robustness of the previous methods.

基于 3D 帧场和特征的复杂模型分解算法
目的六面体网格划分是使用有限元分析(FEA)进行精确模拟的最重要步骤之一。然而,目前业界使用的六面体网格划分方法是一种非自动且低效的方法,即手动将模型分解成合适的块,然后通过映射或扫描算法从这些块中获取六面体网格。本文旨在提出一种基于三维框架场和模型特征的近乎自动的分解算法,以取代传统费时费力的手动分解方法。由凹面特征构建的特征切割面首先会降低模型的复杂度,并将其分解为一些粗块。然后,在这些粗块上执行改进的三维帧场算法,提取奇异结构并构建奇异切割曲面,进一步分解粗块。在大多数建模实例中,所提出的算法使用这两种类型的切割面来全自动分解模型。在少数对六面体网格有特殊要求的例子中,该算法需要手动输入一些用户定义的切割面,并构建不同的奇异切割面,以确保分解的有效性。在本文中,内部约束的引入使三维帧场生成更加稳健,并能自动修正一些无效的 3-5 奇异结构。在一些有特殊要求的例子中,即使模型的奇异结构被用户定义的切割面修改,所提出的算法也能成功生成有效的块。用户定义的切割面可以创建特殊的六面体网格,这在以前的算法中很难实现。此外,还提出了一种改进的三维框架场生成方法,以纠正一些无效的奇异结构,并提高以往方法的鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Engineering Computations
Engineering Computations 工程技术-工程:综合
CiteScore
3.40
自引率
6.20%
发文量
61
审稿时长
5 months
期刊介绍: The journal presents its readers with broad coverage across all branches of engineering and science of the latest development and application of new solution algorithms, innovative numerical methods and/or solution techniques directed at the utilization of computational methods in engineering analysis, engineering design and practice. For more information visit: http://www.emeraldgrouppublishing.com/ec.htm
×
引用
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学术官方微信