Perturbing Bézier coefficients for best constrained degree reduction in the L2-norm

نویسندگان

  • Jianmin Zheng
  • Guozhao Wang
چکیده

This paper first shows how the B ezier coefficients of a given degree n polynomial are perturbed so that it can be reduced to a degree m ð< nÞ polynomial with the constraint that continuity of a prescribed order is preserved at the two endpoints. The perturbation vector, which consists of the perturbation coefficients, is determined by minimizing a weighted Euclidean norm. The optimal degree n 1 approximation polynomial is explicitly given in B ezier form. Next the paper proves that the problem of finding a best L2-approximation over the interval 1⁄20; 1 for constrained degree reduction is equivalent to that of finding a minimum perturbation vector in a certain weighted Euclidean norm. The relevant weights are derived. This result is applied to computing the optimal constrained degree reduction of parametric B ezier curves in the L2-norm. 2003 Elsevier Inc. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constrained polynomial degree reduction in the L2-norm equals best weighted Euclidean approximation of Bézier coefficients

In this paper we show that the best constrained degree reduction of a given Bézier curve f of degree from n to m with Cα−1-continuity at the boundary in L2-norm is equivalent to the best weighted Euclidean approximation of the vector of Bernstein–Bézier (BB) coefficients of f from the vector of degree raised BB coefficients of polynomials of degree m with Cα−1-continuity at the boundary.  2003...

متن کامل

A note on the paper in CAGD (2004, 21 (2), 181-191)

Ahn, Lee, Park and Yoo proved that the best constrained degree reduction of a polynomial f in L2-norm equals the best weighted Euclidean approximation of the Bernstein–Bézier coefficients of f in a paper, published in the journal, Computer Aided Geometric Design 21 (2) (2004) 181–191. In this note, we point out an error in their paper and give the correct result.  2005 Elsevier B.V. All rights...

متن کامل

Multi-degree Reduction of Disk Bézier Curves in L2 Norm ?

A planar Bézier curve whose control points are disks is called a disk Bézier curve. It can be looked as a parametric curve with tolerance in the plane. It is an effective tool to measure or control the error. Based on minimum mean square error, this paper presents an algorithm for optimal multi-degree reduction of disk Bézier curves in L2 norm. First, applying the orthogonal property of Jacobi ...

متن کامل

Constrained approximation of rational Bézier curves based on a matrix expression of its end points continuity condition

For high order interpolations at both end points of two rational Bézier curves, we introduce the concept of C (v,u)-continuity and give a matrix expression of a necessary and sufficient condition for satisfying it. Then we propose three new algorithms, in a unified approach, for the degree reduction of Bézier curves, approximating rational Bézier curves by Bézier curves and the degree reduction...

متن کامل

Pii: S0167-8396(02)00093-6

Given a Bézier curve of degree n, the problem of optimal multi-degree reduction (degree reduction of more than one degree) by a Bézier curve of degreem (m< n−1) with constraints of endpoints continuity is investigated. With respect to L2 norm, this paper presents one approximate method (MDR by L2) that gives an explicit solution to deal with it. The method has good properties of endpoints inter...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Graphical Models

دوره 65  شماره 

صفحات  -

تاریخ انتشار 2003