Abstract
One of the most important recursive schemes in CAGD is De Casteljau's algorithm for the evaluation of Bézier curves and surfaces. Within the theory of triangular recursive schemes we discuss the De Casteljau's algorithm as a particular case, i.e. we prove that it is identical to the E-algorithm (or GNA-algorithm) in a particular frame. This result is of theoretical interest since it leads to some classification of recurrence relations in CAGD. Furthermore, it may be regarded as a model example how to obtain known and possibly new recursive schemes in CAGD as examples of the theory of general extrapolation algorithms.
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.
