Abstract
The error analysis of Farin's and Forrest's algorithms for generating an approximation of degree n − 1 to an n th degree Bézier curve is presented. Algorithms are based on observations of the geometric properties of the Bézier 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.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
