Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

IEEECGIV

2009

IEEE

2009

IEEE

—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´ezier curves. However, there has been no monomial functions for any other kinds of CAGD curves. This w...

Added |
24 May 2010 |

Updated |
24 May 2010 |

Type |
Conference |

Year |
2009 |

Where |
IEEECGIV |

Authors |
Chanon Aphirukmatakun, Natasha Dejdumrong |

Comments (0)