科研之友
微信
新浪微博
Facebook
分享链接
摘要
This paper presents a quadratic programming method for optimal multi-degree reduction of Bezier curves with G(1)-continuity. The L (2) and l (2) measures of distances between the two curves are used as the objective functions. The two additional parameters, available from the coincidence of the oriented tangents, are constrained to be positive so as to satisfy the solvability condition. Finally, degree reduction is changed to solve a quadratic problem of two parameters with linear constraints. Applications of degree reduction of Bezier curves with their parameterizations close to arc-length parameterizations are also discussed.
- 出版日期2007-10
- 单位浙江大学
