Abstract
AbstractBased on the properties of orthogonal polynomials, we derive an explicit constrained degree reduction criterion for Bernstein-Bezier polynomials in L2 -norm. The criterion can be used to determine whether a further degree reduction can be applied to the polynomial in advance with a given tolerance e . An efficient algorithm is also presented for obtaining the best Bernstein-Bezier polynomial after degree reduction. With the proposed algorithm, one can avoid the blind procedure for degree reduction and terminate the procedure in advance when the estimated error is larger than the given tolerance.
Sign-in/Register to access full text options 
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.
