Dual Polynomial Bases
暂无分享,去创建一个
[1] Carl de Boor,et al. A Practical Guide to Splines , 1978, Applied Mathematical Sciences.
[2] C. Micchelli,et al. Blossoming begets B -spline bases built better by B -patches , 1992 .
[3] Lyle Ramshaw,et al. Blossoms are polar forms , 1989, Comput. Aided Geom. Des..
[4] Ron Goldman,et al. Blossoming and knot insertion algorithms for B-spline curves , 1990, Comput. Aided Geom. Des..
[5] Ron Goldman,et al. Wonderful triangle: a simple, unified, algorithmic approach to change of basis procedures in computer aided geometric design , 1992 .
[6] Wolfgang Böhm. Curvature continuous curves and surfaces , 1985, Comput. Aided Geom. Des..
[7] A. A. Ball,et al. Part 1: Introduction of the conic lofting tile , 1993, Comput. Aided Des..
[8] E. T. Y. Lee,et al. A note on blossoming , 1989, Comput. Aided Geom. Des..
[9] Tom Lyche,et al. Discrete B-splines and subdivision techniques in computer-aided geometric design and computer graphics , 1980 .
[10] M. Marsden. An identity for spline functions with applications to variation-diminishing spline approximation☆ , 1970 .
[11] Nira Dyn,et al. Piecewise polynomial spaces and geometric continuity of curves , 1989 .
[12] J. Douglas Faires,et al. Numerical Analysis , 1981 .
[13] Ron Goldman,et al. Knot insertion algorithms for piecewise polynomial spaces determined by connection matrices , 1993, Adv. Comput. Math..
[14] C. D. Boor,et al. On Calculating B-splines , 1972 .
[15] Phillip J. Barry. de Boor - fix functionals and polar forms , 1990, Comput. Aided Geom. Des..
[16] T. Lyche,et al. Making the Oslo algorithm more efficient , 1986 .
[17] Ron Goldman,et al. B-spline, Po´lya curves, and duality , 1991 .
[18] Ron Goldman,et al. Interpolation and approximation of curves and surfaces using Pólya polynomials , 1991, CVGIP Graph. Model. Image Process..