The error analysis for degree reduction of Bezier curves

Cited 13 time in webofscience Cited 0 time in scopus
  • Hit : 174
  • Download : 0
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.
Publisher
Pergamon-Elsevier Science Ltd
Issue Date
1994-01
Language
English
Article Type
Article
Citation

COMPUTERS & MATHEMATICS WITH APPLICATIONS, v.27, no.12, pp.1 - 6

ISSN
0898-1221
URI
http://hdl.handle.net/10203/57121
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 13 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0