1
Ahn Y J, Lee B, Park Y, et al. Constrained polynomial degree reduction in the L 2 -norm equals best weighted Euclidean approximation of Bézier coefficients[J]. Computer Aided Geometric Design, 2004, 21(2): 181-191.
2
Tai C, Hu S, Huang Q, et al. Approximate merging of B-spline curves via knot adjustment and constrained optimization[J]. Computer-aided Design, 2003, 35(10): 893-899.
3
Cheng M, Wang G. Approximate merging of multiple Bézier segments[J]. Progress in Natural Science, 2008, 18(6): 757-762.
4
Pungotra H, Knopf G K, Canas R, et al. Merging multiple B-spline surface patches in a virtual reality environment[J]. Computer-aided Design, 2010, 42(10): 847-859.
5
Chen X, Ma W, Paul J, et al. Multi-degree reduction of Bézier curves using reparameterization[J]. Computer-aided Design, 2011, 43(2): 161-169.
6
Ahn Y J. FUNCTION APPROXIMATION OVER TRIANGULAR DOMAIN USING CONSTRAINED Legendre POLYNOMIALS[C]., 2005, 9(2): 99-106.
7
Chen Guojin. Multi-degree reduction of tensor product Bézier surfaces with conditions of corners interpolations. 2002.
8
Kim H S, Ahn Y J. Constrained degree reduction of polynomials in Bernstein-Bézier form over simplex domain[J]. Journal of Computational and Applied Mathematics, 2008, 216(1): 14-19.
9
Pan R, Weng B. Recursive representation and application of transformation matrices of B-spline bases[J]. Computer Aided Geometric Design, 2009, 26(1): 82-93.
10
Cheng M, Wang G. Multi-degree reduction of NURBS curves based on their explicit matrix representation and polynomial approximation theory[J]. Science in China Series F: Information Sciences, 2004, 47(1): 44-54.