Abstract
Simple recurrence relations for the Bézier coefficients of the dual Bernstein polynomials are given. Using the recurrence relations, we propose fast methods for computing these coefficients. The complexity of the proposed algorithms is O(n), where n is the degree of the considered dual Bernstein polynomial basis.
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.
