A general theory of quasi-interpolants based on trigonometric splines is developed which is analogous to the polynomial spline case. The aim is to construct quasi-interpolants which are local, easy to compute, and which apply to a wide class of functions. As examples, we give a detailed treatment including error bounds for two classes which are especially useful in practice.

We present the details of a multi-resolution method which we proposed in Taormina in 1993 (see [6]) which is suitable for fitting functions or data on the sphere. The method is based on tensor products of polynomial splines and trigonometric splines, and produces surfaces which are tangent plane continuous. The result is a convenient compression algorithm for dealing with large amounts of data ...

in the present research, implementations of different computational geometry technologies in isogeometric analysis framework for computational fracture mechanics are investigated. nurbs and t-splines are two different computational geometry technologies which are studied in this work. among features of b-spline basis functions the possibility of enhancing a b-spline basis with discontinuities b...