Alternating size field optimizing and parameterization domain CAD model remeshing

IF 1.3 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Computer Aided Geometric Design Pub Date : 2024-05-03 DOI:10.1016/j.cagd.2024.102294
Shiyi Wang , Bochun Yang , Hujun Bao , Jin Huang
{"title":"Alternating size field optimizing and parameterization domain CAD model remeshing","authors":"Shiyi Wang ,&nbsp;Bochun Yang ,&nbsp;Hujun Bao ,&nbsp;Jin Huang","doi":"10.1016/j.cagd.2024.102294","DOIUrl":null,"url":null,"abstract":"<div><p>Tessellating CAD models into triangular meshes is a long-lasting problem. Size field is widely used to accommodate varieties of requirements in remeshing, and it is usually discretized and optimized on a prescribed background mesh and kept constant in the subsequent remeshing procedure. Instead, we propose optimizing the size field on the current mesh, then using it as guidance to generate the next mesh. This simple strategy eliminates the need of building a proper background mesh and greatly simplifies the size field query. For better quality and convergence, we also propose a geodesic distance based initialization and adaptive re-weighting strategy in size field optimization. Similar to existing methods, we also view the remeshing of a CAD model as the remeshing of its parameterization domain, which guarantees that all the vertices lie exactly on the CAD surfaces and eliminates the need for costly and error-prone projection operations. However, for vertex smoothing which is important for mesh quality, we carefully optimize the vertex's location in the parameterization domain for the optimal Delaunay triangulation condition, along with a high-order cubature scheme for better accuracy. Experiments show that our method is fast, accurate and controllable. Compared with state-of-the-art methods, our approach is fast and usually generates meshes with smaller Hausdorff error, larger minimal angle with a comparable number of triangles.</p></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"111 ","pages":"Article 102294"},"PeriodicalIF":1.3000,"publicationDate":"2024-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Aided Geometric Design","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167839624000281","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

Tessellating CAD models into triangular meshes is a long-lasting problem. Size field is widely used to accommodate varieties of requirements in remeshing, and it is usually discretized and optimized on a prescribed background mesh and kept constant in the subsequent remeshing procedure. Instead, we propose optimizing the size field on the current mesh, then using it as guidance to generate the next mesh. This simple strategy eliminates the need of building a proper background mesh and greatly simplifies the size field query. For better quality and convergence, we also propose a geodesic distance based initialization and adaptive re-weighting strategy in size field optimization. Similar to existing methods, we also view the remeshing of a CAD model as the remeshing of its parameterization domain, which guarantees that all the vertices lie exactly on the CAD surfaces and eliminates the need for costly and error-prone projection operations. However, for vertex smoothing which is important for mesh quality, we carefully optimize the vertex's location in the parameterization domain for the optimal Delaunay triangulation condition, along with a high-order cubature scheme for better accuracy. Experiments show that our method is fast, accurate and controllable. Compared with state-of-the-art methods, our approach is fast and usually generates meshes with smaller Hausdorff error, larger minimal angle with a comparable number of triangles.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
交替尺寸场优化和参数化域 CAD 模型重塑
将 CAD 模型分解成三角形网格是一个长期存在的问题。尺寸场被广泛用于满足重网格化过程中的各种要求,它通常在规定的背景网格上进行离散化和优化,并在随后的重网格化过程中保持不变。相反,我们建议在当前网格上优化尺寸场,然后以此为指导生成下一个网格。这种简单的策略无需建立适当的背景网格,大大简化了尺寸场查询。为了提高质量和收敛性,我们还在尺寸场优化中提出了基于大地距离的初始化和自适应再加权策略。与现有方法类似,我们也将 CAD 模型的重网格化视为其参数化域的重网格化,这保证了所有顶点都精确位于 CAD 曲面上,并省去了昂贵且易出错的投影操作。然而,对于对网格质量非常重要的顶点平滑,我们会仔细优化顶点在参数化域中的位置,以获得最佳的 Delaunay 三角剖分条件,并采用高阶立方体方案以获得更高的精度。实验表明,我们的方法快速、准确、可控。与最先进的方法相比,我们的方法速度更快,生成的网格通常具有更小的 Hausdorff 误差和更大的最小角,而且三角形数量相当。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computer Aided Geometric Design
Computer Aided Geometric Design 工程技术-计算机:软件工程
CiteScore
3.50
自引率
13.30%
发文量
57
审稿时长
60 days
期刊介绍: The journal Computer Aided Geometric Design is for researchers, scholars, and software developers dealing with mathematical and computational methods for the description of geometric objects as they arise in areas ranging from CAD/CAM to robotics and scientific visualization. The journal publishes original research papers, survey papers and with quick editorial decisions short communications of at most 3 pages. The primary objects of interest are curves, surfaces, and volumes such as splines (NURBS), meshes, subdivision surfaces as well as algorithms to generate, analyze, and manipulate them. This journal will report on new developments in CAGD and its applications, including but not restricted to the following: -Mathematical and Geometric Foundations- Curve, Surface, and Volume generation- CAGD applications in Numerical Analysis, Computational Geometry, Computer Graphics, or Computer Vision- Industrial, medical, and scientific applications. The aim is to collect and disseminate information on computer aided design in one journal. To provide the user community with methods and algorithms for representing curves and surfaces. To illustrate computer aided geometric design by means of interesting applications. To combine curve and surface methods with computer graphics. To explain scientific phenomena by means of computer graphics. To concentrate on the interaction between theory and application. To expose unsolved problems of the practice. To develop new methods in computer aided geometry.
期刊最新文献
A shift-invariant C12-subdivision algorithm which rotates the lattice RBF-MAT: Computing medial axis transform from point clouds by optimizing radial basis functions Editorial Board Infinity branches and asymptotic analysis of algebraic space curves: New techniques and applications Editorial Board
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1