Surface algorithms using bounds on derivatives

More documents

Recommendations

Info

310 D. Filip et al. / <strong>Surface</strong> <strong>algorithms</strong> Now let C2(v ) =/(u o, v), L2(v ) = (1 - v)f(A) + of(C), and let C3(/3 ) =/(u o + ll, v), L3(v ) = (1 - v)I(B) + of(D). Then and similarly d(P 2, Q)
D. Filip et al. / <strong>Surface</strong> <strong>algorithms</strong> 311 Lane, J.M. and Carpenter, L. (1979), A generalized ~ line algorithm for the computer display of parametrically defined surfaces, Computer Vision, Graphics, and Image Processing 11, 290-297. Lane, J.M. and Riesenfeld, R.F. (1980), A theoretical development for the computer generation and display of piecewise polynomial surfaces, IEEE Trans. Pattern Anal. Machine InteU. 2 (1) 35-46. Lane, J.M. and Riesenfeld, R.F. (1981), Bounds on a polynomial, BIT 21, 112-117. Prenter, P.M. (1975), Splines and Variational Methods, Wiley, New York. Wang, G. (1984), The subdivision method for finding the intersection between two B~zier curves or surfaces, Zhejiang University J., Special Issue on Computational Geometry (in Chinese).
Page 1 and 2: Computer Aided Geometric Design 3 (
Page 3 and 4: Which implies D. Filip et al. / <st
Page 5 and 6: which implies II e(p0)II2< lie(p0)I
Page 7 and 8: D. Filip et al. / Surface</
Page 9 and 10: D. Filip et al. / Surface</
Page 11 and 12: D. Filip et at. / Surface</
Page 13 and 14: neously by using t
Page 15: 5. Geometric vs. parametric distanc

Surface algorithms using bounds on derivatives

Create successful ePaper yourself

Delete template?

Save as template?