A Region-growing GradNormal Algorithm for Geometrically and Topologically Accurate Mesh Extraction

IF 3 3区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Chen Zong , Jinhui Zhao , Pengfei Wang , Shuangmin Chen , Shiqing Xin , Yuanfeng Zhou , Changhe Tu , Wenping Wang
{"title":"A Region-growing GradNormal Algorithm for Geometrically and Topologically Accurate Mesh Extraction","authors":"Chen Zong ,&nbsp;Jinhui Zhao ,&nbsp;Pengfei Wang ,&nbsp;Shuangmin Chen ,&nbsp;Shiqing Xin ,&nbsp;Yuanfeng Zhou ,&nbsp;Changhe Tu ,&nbsp;Wenping Wang","doi":"10.1016/j.cad.2023.103559","DOIUrl":null,"url":null,"abstract":"<div><p>With the prevalence of implicit shape processing and reconstruction, extracting a polygonal mesh of an isosurface from volume data, which plays an important role in these tasks, is receiving more and more attention. GradNormal, a recently proposed marching tetrahedra method, can effectively extract high-quality meshes from analytic functional shapes but suffers from detail loss and computational inefficiency issues. In this paper, we improve GradNormal from four aspects. First, we extend GradNormal from an analytic function to an arbitrary geometric domain equipped with the projection operation. Second, we select a seed tetrahedron and find only the tetrahedra intersecting the implicit surface, in a region-growing style, which helps save memory and accelerate calculation. Third, we invent a hierarchical tiling mechanism to enhance the recovery accuracy of the resulting mesh, unlike the uniform tiling used in GradNormal. Finally, we propose to accurately predict how the underlying surface goes through a tetrahedral element so that complicated topological structures such as thin plates and gaps can be well captured. Extensive experimental results on challenging shapes show that the improved GradNormal is able to quickly produce a feature-adapted triangle mesh that is more topologically and geometrically accurate than the state-of-the-art.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":null,"pages":null},"PeriodicalIF":3.0000,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer-Aided Design","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S001044852300091X","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 1

Abstract

With the prevalence of implicit shape processing and reconstruction, extracting a polygonal mesh of an isosurface from volume data, which plays an important role in these tasks, is receiving more and more attention. GradNormal, a recently proposed marching tetrahedra method, can effectively extract high-quality meshes from analytic functional shapes but suffers from detail loss and computational inefficiency issues. In this paper, we improve GradNormal from four aspects. First, we extend GradNormal from an analytic function to an arbitrary geometric domain equipped with the projection operation. Second, we select a seed tetrahedron and find only the tetrahedra intersecting the implicit surface, in a region-growing style, which helps save memory and accelerate calculation. Third, we invent a hierarchical tiling mechanism to enhance the recovery accuracy of the resulting mesh, unlike the uniform tiling used in GradNormal. Finally, we propose to accurately predict how the underlying surface goes through a tetrahedral element so that complicated topological structures such as thin plates and gaps can be well captured. Extensive experimental results on challenging shapes show that the improved GradNormal is able to quickly produce a feature-adapted triangle mesh that is more topologically and geometrically accurate than the state-of-the-art.

Abstract Image

一种用于几何和拓扑精确网格提取的区域增长GradNormal算法
随着隐式形状处理和重建的普及,从体积数据中提取等值面的多边形网格越来越受到关注,这在这些任务中起着重要作用。GradNormal是最近提出的一种行进四面体方法,可以有效地从解析函数形状中提取高质量的网格,但存在细节损失和计算效率低下的问题。本文从四个方面对GradNormal进行了改进。首先,我们将GradNormal从解析函数扩展到配备了投影操作的任意几何域。其次,我们选择一个种子四面体,只找到与隐式曲面相交的四面体,采用区域生长方式,这有助于节省内存和加速计算。第三,我们发明了一种分层平铺机制,以提高生成网格的恢复精度,这与GradNormal中使用的均匀平铺不同。最后,我们建议准确预测下表面如何穿过四面体单元,以便很好地捕捉薄板和间隙等复杂的拓扑结构。对具有挑战性的形状进行的大量实验结果表明,改进的GradNormal能够快速生成特征自适应的三角形网格,该网格在拓扑和几何上比现有技术更准确。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信