DC Field | Value | Language |
---|---|---|
dc.contributor.author | Choi, UJin | ko |
dc.date.accessioned | 2013-02-24T12:25:36Z | - |
dc.date.available | 2013-02-24T12:25:36Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1994-01 | - |
dc.identifier.citation | COMPUTERS & MATHEMATICS WITH APPLICATIONS, v.27, no.12, pp.1 - 6 | - |
dc.identifier.issn | 0898-1221 | - |
dc.identifier.uri | http://hdl.handle.net/10203/57121 | - |
dc.description.abstract | The error analysis of Farin's and Forrest's algorithms for generating an approximation of degree n - 1 to an n(th) degree Bezier curve is presented. Algorithms are based on observations of the geometric properties of the Bezier curve which allow the development of detailed error analysis. By combining subdivision with a degree reduction algorithm, a piecewise approximation can be generated, which is within some preset error tolerance of the original curve. The number of subdivisions required can be determined a priori and a piecewise approximation of degree m can be generated by iterating the scheme. | - |
dc.language | English | - |
dc.publisher | Pergamon-Elsevier Science Ltd | - |
dc.title | The error analysis for degree reduction of Bezier curves | - |
dc.type | Article | - |
dc.identifier.wosid | A1994NU28600001 | - |
dc.identifier.scopusid | 2-s2.0-0003357456 | - |
dc.type.rims | ART | - |
dc.citation.volume | 27 | - |
dc.citation.issue | 12 | - |
dc.citation.beginningpage | 1 | - |
dc.citation.endingpage | 6 | - |
dc.citation.publicationname | COMPUTERS & MATHEMATICS WITH APPLICATIONS | - |
dc.contributor.localauthor | Choi, UJin | - |
dc.type.journalArticle | Article | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.