New monomial forms approach for DP and NB1 curves with their proofs

Conference proceedings article

Authors/Editors

Strategic Research Themes

No matching items found.

Publication Details

Author list: Savetseranee D., Dejdumrong N.

Publisher: Hindawi

Publication year: 2013

Start page: 42

End page: 45

Number of pages: 4

ISBN: 9780769550510

ISSN: 0146-9428

eISSN: 1745-4557

URL: https://www.scopus.com/inward/record.uri?eid=2-s2.0-84892639601&doi=10.1109%2fCGIV.2013.17&partnerID=40&md5=849b931b6fbb1d3f60859cb833cdf2fc

Languages: English-Great Britain (EN-GB)

View on publisher site

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. ฉ 2013 IEEE.

Keywords

Curve conversion, Monomial form