香港大学计算机图形学课件Chapter12A.ppt

Chapter 12 Curves and Surfaces Curves are approximated with straight line segments Curves defined using functions: ellipses, parabola, cos(u), e-u, rational functions, … Curves defined via control points: Polynomials that pass through the points Piecewise polynomials (cubic splines), … Bézier curves B-splines Non-Uniform Rational B-Splines (NURBS) A more efficient algorithm First compute all the bn,i’s from a recursive definition before the summation. void BezierCurve( GLfloat cp[][3], int np, double u, GLfloat p[]) { double b[100], x, y, z, u1; int n = np - 1; if (u .99999) u = .99999; u1 = 1. - u; b[0] = pow( u1, n); for (int i=1; i=n; ++i) { b[i] = b[i-1] * (n-i+1) / i * u / u1; } x = y = z = 0.; for (int i=0; i=n; ++i) { x = x + b[i]*cp[i][0]; y = y + b[i]*cp[i][1]; z = z + b[i]*cp[i][2]; } p[0] = x; p[1] = y; p[2] = z; } * Polynomials Given k + 1 points, fit a kth degree polynomial that passes through the points. A quadratic polynomial that passes through 3 given points u x x = p(u) = a + b u + cu2 Lagrange polynomials that passes through two points (u0, x0), (u1, x1) that passes through three points (u0, x0), (u1, x1), (u2, x2), Lagrange polynomials on vertices Two points Three points P0 P1 u=0 u=1 P0 P1 P2 u=0 u=2 u=1 That passes through 4 points When k is large, say, 4, 5 or beyond, this approach is inefficient. Undesirable oscillations often occur in high degree polynomials A 5th degree polynomial A more desirable curve Splines (piecewise polynomials) Constant splines The curve that goes through the points is approximated with horizontal lines (0 degree polynomials) qi(u) = ui . qi(u)s are discontinuous, ie, qi(ui) ? qi+1(ui). u0 u1 u2 x u3 . . . g1(u) g2(u) g3(u) g0(u) Linear splines The curve is approximated with straight lines (1st degree polynomials)