|
|
Transformation between weighted orthogonal basis satisfying
end point constraints and Bernstein basis and its application |
CAI Hua-hui1,2, WANG Guo-Jin1 |
1. State Key Laboratory of CAD&CG, Zhejiang University, Hangzhou 310027, China;
2. School of Information Engineering, Jingdezhen Ceramic Institute, Jingdezhen 333403, China |
|
|
Abstract The transformation matrices between the weighted orthogonal basis which possesses end point constraints characteristic and Bernstein basis were derived in order to effectively obtain the optimal algorithm for constrained multidegree reducing Bézier curve based on Jacobi weighted L2 norm in computer aided geometric design (CAGD). A method for constructing Jacobiweighted orthogonal polynomials satisfying end point constraints in the Bernstein form was formulated, and the transformation matrices between Jacobiweighted orthogonal basis and Bernstein basis were presented. Then the matrix representation for constrained multidegree reducing Bézier curve was presented by the matrices, and the degree reduction error that can be forecasted was given. The Jacobi weighted function adapting to optimal degree reduction was selected with respect to L2、L1、L∞ norm, respectively. Numerical examples were presented and analyzed. The method is simple and easy to realize.
|
Published: 05 May 2011
|
|
端点约束加权正交基与Bernstein基的转换及应用
为了在计算机辅助几何设计(CAGD)中,有效地求解在Jacobi加权L2范数下Bézier曲线约束最佳降多阶逼近问题,推导具有端点约束特征的加权正交基与Bernstein基之间的转换矩阵.利用Bernstein基构造端点约束加权正交基,给出约束加权正交基与Bernstein基的相互转换矩阵,利用该矩阵给出具体的端点约束最佳降多阶矩阵和该降阶逼近的可预报的误差公式,提出在L2、L1、L∞范数下适合于最佳降阶逼近的相应Jacobi基的权函数的选取方案.通过具体实例对逼近算法进行演示与分析.结果表明,该算法表示简单,易于实现.
|
|
[1] JTTLER B. The dual basis functions for the Bernstein polynomials [J]. Advances in Computational Mathematics, 1998, 8(4): 345-352.
[2] RABABAH A, ALNATOUR M. Weighted dual functionals for the univariate Bernstein basis [J]. Applied Mathematics and Computation, 2007, 186(2): 1581-1590.
[3] RABABAH A, ALNATOUR M. Weighted dual functions for Bernstein basis satisfying boundary constraints [J]. Applied Mathematics and Computation, 2008, 199(2): 456-463.
[4] LI Y M, ZHANG X Y. Basis conversion among Bezier, Tchebyshev and Legendre [J]. Computer Aided Geometric Design, 1998, 15(6): 637-642.
[5] FAROUKI R T. LegendreBernstein basis transformations [J]. Journal of Computational and Applied Mathematics, 2000, 119(1/2): 145-160.
[6] RABABAH A. Transformation of ChebyshevBernstein polynomial basis [J]. Computational Methods in Applied Mathematics, 2004, 4(4): 608-622.
[7] RABABAH A. JacobiBernstein basis transformation [J]. Computational Methods in Applied Mathematics, 2004, 4(2): 206-214.
[8] 王国瑾,汪国昭,郑建民.计算机辅助几何设计[M].北京:高等教育出版社,2001: 250-254.
[9] 王国瑾,喻春明.Bézier曲线约束降多阶算法的分析与比较[J].浙江大学学报:工学版,2007,41(11): 1805-1809.
WANG Guojin, YU Chunming. Analysis and comparison of algorithms for multidegree reduction with constrained Bézier curves [J]. Journal of Zhejiang University: Engineering Science, 2007, 41(11): 1805-1809.
[10] CHEN G D, WANG G J. Optimal multidegree reduction of Bézier curves with constraints of endpoints continuity [J]. Computer Aided Geometric Design, 2002, 19(6): 365-377.
[11] SUNWOO H. Matrix representation for multidegree reduction of Bézier curves [J]. Computer Aided Geometric Design, 2005, 22(3): 261-273.
[12] RABABAH A, LEE BG, YOO J. Multiple degree reduction and elevation of Bézier curves using JacobiBernstein Basis transformations [J]. Numerical Functional Analysis and Optimization, 2007, 28(9/10): 1179-1196.
[13] SZEGO G P. Orthogonal polynomials [M]. Providence: The American Mathematical Society, 1975: 5-899.
[14] MASON J C, HANDSCOMB J C. Chebyshev polynomials [M]. Florida: Chapman, 2002: 165-173. |
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
|
Shared |
|
|
|
|
|
Discussed |
|
|
|
|