A quadratic programming method for optimal degree reduction of Bezier curves with G1-continuity

被引：1
|
作者：
Li-zheng, Lu [1 ]
Guo-zhao, Wang [1 ]
机构：
[1] Zhejiang Univ, Dept Math, Inst Comp Graph & Image Proc, Hangzhou 310027, Peoples R China
来源：
JOURNAL OF ZHEJIANG UNIVERSITY-SCIENCE A | 2007年 / 8卷 / 10期
基金：
中国国家自然科学基金;
关键词：
degree reduction; Bezier curves; optimal approximation; G(1)-continuity; quadratic programming;
D O I：
10.1631/jzus.2007.A1657
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
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.
引用
收藏
页码：1657 / 1662
页数：6
相关论文
共 50 条
12345