Michelangelo Marsala , Carla Manni , Hendrik Speleers
{"title":"任意三角形上的最大平滑三次样条准内插法","authors":"Michelangelo Marsala , Carla Manni , 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":"{\"title\":\"Maximally smooth cubic spline quasi-interpolants on arbitrary triangulations\",\"authors\":\"Michelangelo Marsala , Carla Manni , 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}","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
摘要
我们研究了在给定的任意三角形 T 上构建 C2 立方样条准内插法,以逼近一个足够平滑的函数 f。通过考虑 T 的每个三角形上的局部 Hermite 插值问题,可以唯一确定立方王石样条曲线空间的任何元素。所有提出的准内插法都能再现三次多项式,并通过各种数值示例说明了它们的性能。
Maximally smooth cubic spline quasi-interpolants on arbitrary triangulations
We investigate the construction of cubic spline quasi-interpolants on a given arbitrary triangulation 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 and like a Bernstein basis for imposing smoothness across the edges of . Any element of the cubic Wang–Shi spline space can be uniquely identified by considering a local Hermite interpolation problem on every triangle of . Different 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.
期刊介绍:
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.