论文信息 - An optimal algorithm for expanding the composition of polynomials

An optimal algorithm for expanding the composition of polynomials

A runtime analysis is made of a previously published algorithm for polynomial composition. The relationship between this composition algorithm and Sablonnie`re's algorithm is explored. This composition algorithm is then made optimal aby first performing a change of basis.

Stephen Mann | Wayne Liu

[1] Ron Goldman,et al. Functional composition algorithms via blossoming , 1993, TOGS.

[2] P. Sablonnière. Spline and Bézier polygons associated with a polynomial spline curve , 1978 .

[3] Stephen Mann,et al. An Analysis of Polynomial Composition Algorithms , 1995 .

[4] Phillip J. Barry,et al. Chapter 4: Knot Insertion Algorithms , 1992, Knot Insertion and Deletion Algorithms for B-Spline Curves and Surfaces.

[5] C. D. Boor,et al. B-Form Basics. , 1986 .

[6] T. DeRose,et al. A coordinate-free approach to geometric programming , 1989 .

[7] Tony DeRose,et al. Composing Bézier simplexes , 1988, TOGS.

[8] Gerald Farin,et al. Curves and surfaces for computer aided geometric design , 1990 .