New Monomial Forms Approach for DP and NB1 Curves with Their Proofs

Dilokvith Savetseranee, N. Dejdumrong
{"title":"New Monomial Forms Approach for DP and NB1 Curves with Their Proofs","authors":"Dilokvith Savetseranee, N. Dejdumrong","doi":"10.1109/CGIV.2013.17","DOIUrl":null,"url":null,"abstract":"There are several methods used to construct curves in CAGD, e.g., the de Casteljaus algorithm, DP algorithm, and NB1 algorithm. However, they are represented in the forms that are not suitable for performing geometric modeling. A proposed approach for evaluating DP curve, NB1 Curve by using monomial form was introduced by Aphirukmatakun and Dejdumrong in 2009. The authors did not provide any proofs for their propositions. Thus, this paper shows the proofs for the conversions from DP polynomial into its monomial form as well as NB1 polynomial.","PeriodicalId":342914,"journal":{"name":"2013 10th International Conference Computer Graphics, Imaging and Visualization","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 10th International Conference Computer Graphics, Imaging and Visualization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CGIV.2013.17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

There are several methods used to construct curves in CAGD, e.g., the de Casteljaus algorithm, DP algorithm, and NB1 algorithm. However, they are represented in the forms that are not suitable for performing geometric modeling. A proposed approach for evaluating DP curve, NB1 Curve by using monomial form was introduced by Aphirukmatakun and Dejdumrong in 2009. The authors did not provide any proofs for their propositions. Thus, this paper shows the proofs for the conversions from DP polynomial into its monomial form as well as NB1 polynomial.
DP曲线和NB1曲线的新单项式形式方法及其证明
在CAGD中,有几种构造曲线的方法,如de Casteljaus算法、DP算法和NB1算法。然而,它们以不适合进行几何建模的形式表示。2009年,apirukmatakun和Dejdumrong提出了一种用单项形式评价DP曲线、NB1曲线的方法。作者没有为他们的命题提供任何证据。因此,本文给出了DP多项式转化为其单项式形式以及NB1多项式的证明。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信