AN ERROR BOUND ANALYSIS FOR CUBIC SPLINE APPROXIMATION OF CONIC SECTION
نویسندگان
چکیده
منابع مشابه
An analysis of cubic approximation schemes for conic sections
In this paper a piece of a conic section is approximated by a cubic or piecewise cubic polynomial. The main tool is to define the two inner control points of the cubic as an affine combination, defined by λ ∈ [0, 1], of two control points of the conic. If λ is taken to depend on the weight w of the latter, a function λ(w) results which is used to distinguish between different algorithms and to ...
متن کاملGeometric Conic Spline Approximation in Cagd
We characterize the best geometric conic approximation to regular plane curve and verify its uniqueness. Our characterization for the best geometric conic approximation can be applied to degree reduction, offset curve approximation or convolution curve approximation which are very frequently occurred in CAGD(Computer Aided Geometric Design). We also present the numerical results for these appli...
متن کاملCone spline approximation via fat conic spline fitting
Fat conic section and fat conic spline are defined. With well established properties of fat conic splines, the problem of approximating a ruled surface by a tangent smooth cone spline can then be changed as the problem of fitting a plane fat curve by a fat conic spline. Moreover, the fitting error between the ruled surface and the cone spline can be estimated explicitly via fat conic spline fit...
متن کاملAn Upper Bound Solution for Analysis of Twist Extrusion Process with Elliptical Die Cross-section
Twist extrusion process is a rather new route to produce highly strained materials. In this process, severe plastic deformation is applied by large shear strains. In current article, required energy for twist extrusion by use of admissible velocity field together with the upper bound technique is predicted. The proposed model is capable of considering the effect of various parameters such as di...
متن کاملAn Approximation Error Lower Bound for Integer Polynomial Minimax Approximation
The need to solve a polynomial minimax approximation problem appears often in science. It is especially common in signal processing and in particular in filter design. The results presented in this paper originated from a study of the finite wordlength restriction in the FIR digital filter design problem. They are, however, much more general and can be applied to any polynomial minimax approxim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications of the Korean Mathematical Society
سال: 2002
ISSN: 1225-1763
DOI: 10.4134/ckms.2002.17.4.741