Efficient evaluation of Bernstein-Bézier coefficients of B-spline basis functions over one knot span

IF 3 3区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING Computer-Aided Design Pub Date : 2024-09-19 DOI:10.1016/j.cad.2024.103804
Filip Chudy, Paweł Woźny
{"title":"Efficient evaluation of Bernstein-Bézier coefficients of B-spline basis functions over one knot span","authors":"Filip Chudy,&nbsp;Paweł Woźny","doi":"10.1016/j.cad.2024.103804","DOIUrl":null,"url":null,"abstract":"<div><div>New differential-recurrence relations for B-spline basis functions are given. Using these relations, a recursive method for finding the Bernstein-Bézier coefficients of B-spline basis functions over a single knot span is proposed. The algorithm works for any knot sequence and has an asymptotically optimal computational complexity. Numerical experiments show that the new method gives results which preserve a high number of digits when compared to an approach which uses the well-known de Boor-Cox formula.</div></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":"178 ","pages":"Article 103804"},"PeriodicalIF":3.0000,"publicationDate":"2024-09-19","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/S0010448524001313","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

New differential-recurrence relations for B-spline basis functions are given. Using these relations, a recursive method for finding the Bernstein-Bézier coefficients of B-spline basis functions over a single knot span is proposed. The algorithm works for any knot sequence and has an asymptotically optimal computational complexity. Numerical experiments show that the new method gives results which preserve a high number of digits when compared to an approach which uses the well-known de Boor-Cox formula.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在一个节点跨度上高效评估 B-样条曲线基函数的伯恩斯坦-贝塞尔系数
给出了 B-样条曲线基函数的新微分递推关系。利用这些关系,提出了一种在单节跨度上寻找 B-样条曲线基函数伯恩斯坦-贝塞尔系数的递归方法。该算法适用于任何节点序列,并具有渐近最优的计算复杂度。数值实验表明,与使用著名的 de Boor-Cox 公式的方法相比,新方法得出的结果保留了较高的位数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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.
期刊最新文献
Extracting fiber paths from the optimized lamination parameters of variable-stiffness laminated shells based on physic-informed neural network A Hybrid Recognition Framework for Highly Interacting Machining Features Based on Primitive Decomposition, Learning and Reconstruction Editorial Board SITF: A Self-Supervised Iterative Training Framework for Point Cloud Denoising Two-Level High-Resolution Structural Topology Optimization with Equilibrated Cells
×
引用
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