CLC number: TP391.72
On-line Access:
Received: 2007-01-22
Revision Accepted: 2007-04-05
Crosschecked: 0000-00-00
Cited: 0
Clicked: 5292
LU Li-zheng, WANG Guo-zhao. A quadratic programming method for optimal degree reduction of Bézier curves with G1-continuity[J]. Journal of Zhejiang University Science A, 2007, 8(10): 1657-1662.
@article{title="A quadratic programming method for optimal degree reduction of Bézier curves with G1-continuity",
author="LU Li-zheng, WANG Guo-zhao",
journal="Journal of Zhejiang University Science A",
volume="8",
number="10",
pages="1657-1662",
year="2007",
publisher="Zhejiang University Press & Springer",
doi="10.1631/jzus.2007.A1657"
}
%0 Journal Article
%T A quadratic programming method for optimal degree reduction of Bézier curves with G1-continuity
%A LU Li-zheng
%A WANG Guo-zhao
%J Journal of Zhejiang University SCIENCE A
%V 8
%N 10
%P 1657-1662
%@ 1673-565X
%D 2007
%I Zhejiang University Press & Springer
%DOI 10.1631/jzus.2007.A1657
TY - JOUR
T1 - A quadratic programming method for optimal degree reduction of Bézier curves with G1-continuity
A1 - LU Li-zheng
A1 - WANG Guo-zhao
J0 - Journal of Zhejiang University Science A
VL - 8
IS - 10
SP - 1657
EP - 1662
%@ 1673-565X
Y1 - 2007
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/jzus.2007.A1657
Abstract: This paper presents a quadratic programming method for optimal multi-degree reduction of bézier curves with G1-continuity. The L2 and l2 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 bézier curves with their parameterizations close to arc-length parameterizations are also discussed.
[1] Ahn, Y.J., 2003. Using Jacobi polynomials for degree reduction of Bézier curves with Ck-constraints. Computer Aided Geometric Design, 20(7):423-434.
[2] Ahn, Y.J., Lee, B.G., Park, Y., Yoo, J., 2004. Constrained polynomial degree reduction in the L2-norm equals best weighted Euclidean approximation of Bézier coefficients. Computer Aided Geometric Design, 21(2):181-191.
[3] Costantini, P., Farouki, R.T., Manni, C., Sestini, A., 2001. Computation of optimal composite re-parameterizations. Computer Aided Geometric Design, 18(9):875-897.
[4] Degen, W.L.F., 2005. Geometric Hermite interpolation—in memoriam Josef Hoschek. Computer Aided Geometric Design, 22(7):573-592.
[5] Eck, M., 1995. Least squares degree reduction of Bézier curves. Computer-Aided Design, 27(11):845-851.
[6] Farin, G., 2001. Curves and Surfaces for CAGD (5th Ed.). Morgan Kaufmann, San Fransisco, p.57-93.
[7] Farouki, R.T., 1997. Optimal parameterizations. Computer Aided Geometric Design, 14(2):153-168.
[8] Gill, P., Murray, W., Wright, M., 1981. Practical Optimization. Academic Press, New York, p.59-203.
[9] Lee, B.G., Park, Y., Yoo, J., 2002. Application of Legendre-Bernstein basis transformations to degree elevation and degree reduction. Computer Aided Geometric Design, 19(9):709-718.
[10] Lu, L., Wang, G., 2006a. Optimal multi-degree reduction of Bézier curves with G1-continuity. J. Zhejiang Univ. Sci. A, 7(Suppl. II):174-180.
[11] Lu, L., Wang, G., 2006b. Optimal multi-degree reduction of Bézier curves with G2-continuity. Computer Aided Geometric Design, 23(9):673-683.
[12] Pottmann, H., Leopoldseder, S., Hofer, M., 2002. Approximation with Active B-spline Curves and Surfaces. Proc. Pacific Graphics. IEEE Press, Los Alamitos, p.8-25.
[13] Rababah, A., Lee, B.G., Yoo, J., 2006. A simple matrix form for degree reduction of Bézier curves using Chebyshev-Bernstein basis transformations. Appl. Math. Comput., 181(1):310-318.
[14] Watkins, M.A., Worsey, A.J., 1988. Degree reduction of Bézier curves. Computer-Aided Design, 20(7):398-405.
[15] Zheng, J., Wang, G., 2003. Perturbing Bézier coefficients for best constrained degree reduction in the L2-norm. Graph. Models, 65(6):351-368.
Open peer comments: Debate/Discuss/Question/Opinion
<1>