SDF-CWF:从带符号距离函数中提取高质量网格的弱特征整合

IF 3 3区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Longdu Liu (Researcher) , Hao Yu , Shiqing Xin , Shuangmin Chen , Hongwei Lin , Wenping Wang , Changhe Tu
{"title":"SDF-CWF:从带符号距离函数中提取高质量网格的弱特征整合","authors":"Longdu Liu (Researcher) ,&nbsp;Hao Yu ,&nbsp;Shiqing Xin ,&nbsp;Shuangmin Chen ,&nbsp;Hongwei Lin ,&nbsp;Wenping Wang ,&nbsp;Changhe Tu","doi":"10.1016/j.cad.2025.103912","DOIUrl":null,"url":null,"abstract":"<div><div>With advancements in geometric deep learning techniques, neural signed distance functions (SDFs) have gained popularity for their flexibility. Recent studies show that neural SDFs can retain geometric details and encode sharp features. However, during the mesh extraction stage, methods like marching cubes may degrade these geometric details and sharp features, thus compromising the expressiveness of neural SDFs.</div><div>In this paper, we aim to develop a general-purpose mesh extraction method for both freeform and CAD models, assuming the availability of a SDF. Our goal is to produce a well-triangulated, resolution-adjustable mesh surface that preserves rich geometric details and distinct feature lines. Our approach is inspired by Centroidal Voronoi Tessellation (CVT) but introduces two key modifications. First, we extend CVT computation to implicit representations, where explicit surface decomposition is not available. Second, we propose a measure for estimating the likelihood that a point lies on feature lines, enabling the extraction of feature-aligned triangle meshes using power diagrams (with site weights positively correlated to the likelihood values). Comprehensive comparisons with state-of-the-art methods demonstrate the superiority of our approach in both feature alignment and triangulation quality.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"188 ","pages":"Article 103912"},"PeriodicalIF":3.0000,"publicationDate":"2025-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"SDF-CWF: Consolidating Weak Features in High-Quality Mesh Extraction from Signed Distance Functions\",\"authors\":\"Longdu Liu (Researcher) ,&nbsp;Hao Yu ,&nbsp;Shiqing Xin ,&nbsp;Shuangmin Chen ,&nbsp;Hongwei Lin ,&nbsp;Wenping Wang ,&nbsp;Changhe Tu\",\"doi\":\"10.1016/j.cad.2025.103912\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>With advancements in geometric deep learning techniques, neural signed distance functions (SDFs) have gained popularity for their flexibility. Recent studies show that neural SDFs can retain geometric details and encode sharp features. However, during the mesh extraction stage, methods like marching cubes may degrade these geometric details and sharp features, thus compromising the expressiveness of neural SDFs.</div><div>In this paper, we aim to develop a general-purpose mesh extraction method for both freeform and CAD models, assuming the availability of a SDF. Our goal is to produce a well-triangulated, resolution-adjustable mesh surface that preserves rich geometric details and distinct feature lines. Our approach is inspired by Centroidal Voronoi Tessellation (CVT) but introduces two key modifications. First, we extend CVT computation to implicit representations, where explicit surface decomposition is not available. Second, we propose a measure for estimating the likelihood that a point lies on feature lines, enabling the extraction of feature-aligned triangle meshes using power diagrams (with site weights positively correlated to the likelihood values). Comprehensive comparisons with state-of-the-art methods demonstrate the superiority of our approach in both feature alignment and triangulation quality.</div></div>\",\"PeriodicalId\":50632,\"journal\":{\"name\":\"Computer-Aided Design\",\"volume\":\"188 \",\"pages\":\"Article 103912\"},\"PeriodicalIF\":3.0000,\"publicationDate\":\"2025-07-08\",\"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/S0010448525000739\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer-Aided Design","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0010448525000739","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

摘要

随着几何深度学习技术的进步,神经符号距离函数(sdf)因其灵活性而受到欢迎。最近的研究表明,神经sdf可以保留几何细节并编码尖锐特征。然而,在网格提取阶段,像行进立方体这样的方法可能会降低这些几何细节和尖锐特征,从而影响神经sdf的表达性。在本文中,我们的目标是为自由形状和CAD模型开发一种通用的网格提取方法,假设SDF的可用性。我们的目标是产生一个良好的三角化,分辨率可调的网格表面,保留丰富的几何细节和鲜明的特征线。我们的方法受到质心Voronoi镶嵌(CVT)的启发,但引入了两个关键的修改。首先,我们将CVT计算扩展到隐式表示,其中显式表面分解是不可用的。其次,我们提出了一种估计点位于特征线上的可能性的方法,从而可以使用功率图(站点权重与似然值正相关)提取特征对齐的三角形网格。与最先进的方法进行综合比较,证明了我们的方法在特征对齐和三角测量质量方面的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

SDF-CWF: Consolidating Weak Features in High-Quality Mesh Extraction from Signed Distance Functions

SDF-CWF: Consolidating Weak Features in High-Quality Mesh Extraction from Signed Distance Functions
With advancements in geometric deep learning techniques, neural signed distance functions (SDFs) have gained popularity for their flexibility. Recent studies show that neural SDFs can retain geometric details and encode sharp features. However, during the mesh extraction stage, methods like marching cubes may degrade these geometric details and sharp features, thus compromising the expressiveness of neural SDFs.
In this paper, we aim to develop a general-purpose mesh extraction method for both freeform and CAD models, assuming the availability of a SDF. Our goal is to produce a well-triangulated, resolution-adjustable mesh surface that preserves rich geometric details and distinct feature lines. Our approach is inspired by Centroidal Voronoi Tessellation (CVT) but introduces two key modifications. First, we extend CVT computation to implicit representations, where explicit surface decomposition is not available. Second, we propose a measure for estimating the likelihood that a point lies on feature lines, enabling the extraction of feature-aligned triangle meshes using power diagrams (with site weights positively correlated to the likelihood values). Comprehensive comparisons with state-of-the-art methods demonstrate the superiority of our approach in both feature alignment and triangulation quality.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术文献互助群
群 号:604180095
Book学术官方微信