Both the four-point and the uniform cubic B-spline refinement (i.e. subdivision) schemes double the number of vertices of a closed-loop polygonal curve P and produce sequences of vertices fj and bj respectively. We proposed to analyze a subdivision scheme Js that blends the rules of these two refinement methods to produce vertices of the form vj=(1–s)fj+sbj. Iterative applications of Js yield a...

This paper compares two techniques for the approximation of the offsets to a given planar curve. The two methods are based on approximate conversion of the planar curve into circular splines and Pythagorean hodograph (PH) splines, respectively. The circular splines are obtained using a novel variant of biarc interpolation, while the PH splines are constructed via Hermite interpolation of C boun...

In this paper fuzzy piecewise cubic interpolation is constructed for fuzzy data based on B-spline basis functions. We add two new additional conditions which guarantee uniqueness of fuzzy B-spline interpolation.Other conditions are imposed on the interpolation data to guarantee that the interpolation function to be a well-defined fuzzy function. Finally some examples are given to illustrate the...

in this work we deal with the question: how can one improve the approximation level for some nonlinear integral equations? good candidates for this aim are semi orthogonal b-spline scaling functions and their duals. although there are different works in this area, only b-spline of degree at most 2 are used for this approximation. here we compute b-spline scaling functions of degree 4 and their ...