Many algorithms for curves in Bézier representation can be understood and derived using symmetric polynomials. In this chapter, the relationship between univariate and symmetric multivariate polynomials is explained and the basic CAGD algorithms based on this relationship are presented. The most important algorithm is de Casteljaués. It has several applications and serves as an important theoretical tool.
KeywordsConvex Hull Recursion Formula Curve Generation Polar Form Curve Segment
Unable to display preview. Download preview PDF.