Maximally smooth cubic spline quasi-interpolants on arbitrary triangulations

IF 1.3 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Computer Aided Geometric Design Pub Date : 2024-05-21 DOI:10.1016/j.cagd.2024.102348
Michelangelo Marsala , Carla Manni , Hendrik Speleers
{"title":"Maximally smooth cubic spline quasi-interpolants on arbitrary triangulations","authors":"Michelangelo Marsala ,&nbsp;Carla Manni ,&nbsp;Hendrik Speleers","doi":"10.1016/j.cagd.2024.102348","DOIUrl":null,"url":null,"abstract":"<div><p>We investigate the construction of <span><math><msup><mrow><mi>C</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span> cubic spline quasi-interpolants on a given arbitrary triangulation <span><math><mi>T</mi></math></span> to approximate a sufficiently smooth function <em>f</em>. The proposed quasi-interpolants are locally represented in terms of a simplex spline basis defined on the cubic Wang–Shi refinement of the triangulation. This basis behaves like a B-spline basis within each triangle of <span><math><mi>T</mi></math></span> and like a Bernstein basis for imposing smoothness across the edges of <span><math><mi>T</mi></math></span>. Any element of the cubic Wang–Shi spline space can be uniquely identified by considering a local Hermite interpolation problem on every triangle of <span><math><mi>T</mi></math></span>. Different <span><math><msup><mrow><mi>C</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span> cubic spline quasi-interpolants are then obtained by feeding different sets of Hermite data to this Hermite interpolation problem, possibly reconstructed via local polynomial approximation. All the proposed quasi-interpolants reproduce cubic polynomials and their performance is illustrated with various numerical examples.</p></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"112 ","pages":"Article 102348"},"PeriodicalIF":1.3000,"publicationDate":"2024-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0167839624000827/pdfft?md5=3323aa8370f60e90cbc4a16e5bad56ff&pid=1-s2.0-S0167839624000827-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Aided Geometric Design","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167839624000827","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

We investigate the construction of C2 cubic spline quasi-interpolants on a given arbitrary triangulation T to approximate a sufficiently smooth function f. The proposed quasi-interpolants are locally represented in terms of a simplex spline basis defined on the cubic Wang–Shi refinement of the triangulation. This basis behaves like a B-spline basis within each triangle of T and like a Bernstein basis for imposing smoothness across the edges of T. Any element of the cubic Wang–Shi spline space can be uniquely identified by considering a local Hermite interpolation problem on every triangle of T. Different C2 cubic spline quasi-interpolants are then obtained by feeding different sets of Hermite data to this Hermite interpolation problem, possibly reconstructed via local polynomial approximation. All the proposed quasi-interpolants reproduce cubic polynomials and their performance is illustrated with various numerical examples.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
任意三角形上的最大平滑三次样条准内插法
我们研究了在给定的任意三角形 T 上构建 C2 立方样条准内插法,以逼近一个足够平滑的函数 f。通过考虑 T 的每个三角形上的局部 Hermite 插值问题,可以唯一确定立方王石样条曲线空间的任何元素。所有提出的准内插法都能再现三次多项式,并通过各种数值示例说明了它们的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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.
期刊最新文献
RBF-MAT: Computing medial axis transform from point clouds by optimizing radial basis functions Infinity branches and asymptotic analysis of algebraic space curves: New techniques and applications Editorial Board Approximation properties over self-similar meshes of curved finite elements and applications to subdivision based isogeometric analysis A C1 simplex-spline basis for the Alfeld split in Rs
×
引用
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