Monomial forms for curves in CAGD with their applications

Conference proceedings article

ผู้เขียน/บรรณาธิการ

กลุ่มสาขาการวิจัยเชิงกลยุทธ์

ไม่พบข้อมูลที่เกี่ยวข้อง

รายละเอียดสำหรับงานพิมพ์

รายชื่อผู้แต่ง: Aphirukmatakun C., Dejdumrong N.

ผู้เผยแพร่: Hindawi

ปีที่เผยแพร่ (ค.ศ.): 2009

หน้าแรก: 211

หน้าสุดท้าย: 216

จำนวนหน้า: 6

ISBN: 9780769537894

นอก: 0146-9428

eISSN: 1745-4557

URL: https://www.scopus.com/inward/record.uri?eid=2-s2.0-70549091098&doi=10.1109%2fCGIV.2009.71&partnerID=40&md5=c7f0b93ce646d27f526ae22bfa204e71

ภาษา: English-Great Britain (EN-GB)

ดูในเว็บของวิทยาศาสตร์ | ดูบนเว็บไซต์ของสำนักพิมพ์ | บทความในเว็บของวิทยาศาสตร์

บทคัดย่อ

There are several methods used for plotting curves in CAGD, e.g., by directly computing their basis functions (polynomials) or using their recursive algorithms. For the former method, evaluating a curve using their basis functions is a tedious task because their equations need to be solved by using complicated formulae computations. Whereas for the latter method, implementing a program by using recursive algorithm is simpler than the former method but it takes more computational time. Thus, an alternative method for constructing curves by using the monomial form is introduced. Employing monomial form approach, a curve can be computed by using monomial matrix operations. Because the matrix multiplications can be done in parallel programming, the performance of generating a curve for high degree can be Increased. In the mean time, there exists the monomial functions for any degree B้zier curves. However, there has been no monomial functions for any other kinds of CAGD curves. This work proposes several monomial functions for Said-Ball, Wang-Ball, DP, Dejdumrong and NB1 curves. Consequently, these monomial functions will be useful and convenient for readily computing the derivatives, degree elevations, degree reductions and conversions among these curves. ฉ 2009 IEEE.

คำสำคัญ

Power basis