In Exercises 13-15 concern the subdivision of a Bezier curve shown in Figure 7. Let \({\mathop{\rm x}\nolimits} \left( t \right)\) be the Bezier curve, with control points \({{\mathop{\rm p}\nolimits} _0},...,{{\mathop{\rm p}\nolimits} _3}\), and let \({\mathop{\rm y}\nolimits} \left( t \right)\) and \({\mathop{\rm z}\nolimits} \left( t \right)\) be the subdividing Bezier curves as in the text, with control points \({{\mathop{\rm q}\nolimits} _0},...,{{\mathop{\rm q}\nolimits} _3}\) and \({{\mathop{\rm r}\nolimits} _0},...,{{\mathop{\rm r}\nolimits} _3}\), respectively.
15. Sometimes only one-half of a Bezier curve needs further subdividing. For example, subdivision of the “left” side is accomplished with parts (a) and (c) of Exercise 13 and equation (8). When both halves of the curve \({\mathop{\rm x}\nolimits} \left( t \right)\) are divided, it is possible to organize calculations efficiently to calculate both left and right control points concurrently, without using equation (8) directly.
a. Show that the tangent vector \(y'\left( 1 \right)\) and \(z'\left( 0 \right)\) are equal.
b. Use part (a) to show that \({{\mathop{\rm q}\nolimits} _3}\) (which equals \({{\mathop{\rm r}\nolimits} _0}\)) is the midpoint of the segment from \({{\mathop{\rm q}\nolimits} _2}\) to \({{\mathop{\rm r}\nolimits} _1}\).
c. Using part (b) and the results of Exercises 13 and 14, write an algorithm that computes the control points for both \({\mathop{\rm y}\nolimits} \left( t \right)\) and \({\mathop{\rm z}\nolimits} \left( t \right)\) in an efficient manner. The only operations needed are sums and division by 2.
