Sharp, quantitative bounds on the distance between a polynomial piece and its Bézier control polygon
نویسندگان
چکیده
منابع مشابه
Sharp bounds on the approximation of a Bézier polynomial by its quasi-control polygon
By connecting the points which are the kind of linear combinations of Bézier control points, a broken line polygon called quasi-control polygon is produced. Using it to approximate Bézier segment, this paper obtains two sharp, quantitative bounds, besides depending on the degree of the polynomial, the bounds depend only on the maximal absolute second differences or the sum of absolute second di...
متن کاملSharp, Quantitative Bounds on the Distance Between a Bezier Curve and its Control Polygon
The distance between a Be-....ier segment and its control polygon is bounded in terms of the second differences of the control point sequence and a constant that depends only on the degree of the polynomial. The constant derived here is the smallest possible and is sharp for the Hausdorff distance between control polygon and curve segment. The bound provides a straightforward proof of quadratic...
متن کاملThe distance of a curve to its control polygon
In [5], Nairn, Peters, and Lutterkort derived a new bound on the distance between a Bézier curve and its control polygon. The new aspect of the error bound is that it depends purely on second order differences of control points, rather than on derivatives, typical in previously derived error bounds. As one might expect, the bound tends to zero as the polygon tends to a straight line, reflecting...
متن کاملUnknots with highly knotted control polygons
An example is presented of a cubic Bézier curve that is the unknot (a knot with no crossings), but whose control polygon is knotted. It is also shown that there is no upper bound on the number of crossings in the control polygon for an unknotted Bézier curve. These examples complement known upper bounds on the number of subdivisions sufficient for a control polygon to be ambient isotopic to its...
متن کاملPii: S0167-8396(02)00127-9
In this paper, we show that there exists a close dependence between the control polygon of a polynomial and the minimum of its blossom under symmetric linear constraints. We consider a given minimization problem P , for which a unique solution will be a point δ on the Bézier curve. For the minimization function f , two sufficient conditions exist that ensure the uniqueness of the solution, name...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Aided Geometric Design
دوره 16 شماره
صفحات -
تاریخ انتشار 1999