Curve and Surface Generation and Refinement Based on a High Speed Derivative Algorithm

Sankar P.V., Silbermann M.J., Ferrari L.A.
{"title":"Curve and Surface Generation and Refinement Based on a High Speed Derivative Algorithm","authors":"Sankar P.V.,&nbsp;Silbermann M.J.,&nbsp;Ferrari L.A.","doi":"10.1006/cgip.1994.1008","DOIUrl":null,"url":null,"abstract":"<div><p>We propose an efficient algorithm for the refinement of curves and surfaces using simple knot B-splines. We develop a high speed algorithm for the computation of the <em>r</em>th derivative of an <em>r</em>th order spline and demonstrate that the inverse of this algorithm leads to an efficient refinement algorithm which is an order of magnitude faster than the well known Oslo algorithm. We show how the high speed derivative algorithm can also be used to directly generate spline curves and surfaces much more efficiently than linear combination algorithms and forward differencing.</p></div>","PeriodicalId":100349,"journal":{"name":"CVGIP: Graphical Models and Image Processing","volume":"56 1","pages":"Pages 94-101"},"PeriodicalIF":0.0000,"publicationDate":"1994-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1006/cgip.1994.1008","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"CVGIP: Graphical Models and Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S104996528471008X","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

We propose an efficient algorithm for the refinement of curves and surfaces using simple knot B-splines. We develop a high speed algorithm for the computation of the rth derivative of an rth order spline and demonstrate that the inverse of this algorithm leads to an efficient refinement algorithm which is an order of magnitude faster than the well known Oslo algorithm. We show how the high speed derivative algorithm can also be used to directly generate spline curves and surfaces much more efficiently than linear combination algorithms and forward differencing.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于高速导数算法的曲线曲面生成与精化
我们提出了一种利用简单结b样条对曲线和曲面进行精化的有效算法。我们开发了一种高速算法来计算一个n阶样条的n阶导数,并证明了该算法的逆导致了一种高效的精化算法,其速度比众所周知的奥斯陆算法快一个数量级。我们展示了高速导数算法如何能够比线性组合算法和正向差分更有效地直接生成样条曲线和曲面。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A New Dynamic Approach for Finding the Contour of Bi-Level Images Building Skeleton Models via 3-D Medial Surface Axis Thinning Algorithms Estimation of Edge Parameters and Image Blur Using Polynomial Transforms Binarization and Multithresholding of Document Images Using Connectivity Novel Deconvolution of Noisy Gaussian Filters with a Modified Hermite Expansion
×
引用
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