12,030 research outputs found

    Smooth approximation of data on the sphere with splines

    Get PDF
    A computable function, defined over the sphere, is constructed, which is of classC1 at least and which approximates a given set of data. The construction is based upon tensor product spline basisfunctions, while at the poles of the spherical system of coordinates modified basisfunctions, suggested by the spherical harmonics expansion, are introduced to recover the continuity order at these points. Convergence experiments, refining the grid, are performed and results are compared with similar results available in literature.\ud \ud The approximation accuracy is compared with that of the expansion in terms of spherical harmonics. The use of piecewise approximation, with locally supported basisfunctions, versus approximation with spherical harmonics is discussed

    Curve network interpolation by C1C^1 quadratic B-spline surfaces

    Full text link
    In this paper we investigate the problem of interpolating a B-spline curve network, in order to create a surface satisfying such a constraint and defined by blending functions spanning the space of bivariate C1C^1 quadratic splines on criss-cross triangulations. We prove the existence and uniqueness of the surface, providing a constructive algorithm for its generation. We also present numerical and graphical results and comparisons with other methods.Comment: With respect to the previous version, this version of the paper is improved. The results have been reorganized and it is more general since it deals with non uniform knot partitions. Accepted for publication in Computer Aided Geometric Design, October 201

    Error analysis for quadratic spline quasi-interpolants on non-uniform criss-cross triangulations of bounded rectangular domains

    Full text link
    Given a non-uniform criss-cross partition of a rectangular domain Ω\Omega, we analyse the error between a function ff defined on Ω\Omega and two types of C1C^1-quadratic spline quasi-interpolants (QIs) obtained as linear combinations of B-splines with discrete functionals as coefficients. The main novelties are the facts that supports of B-splines are contained in Ω\Omega and that data sites also lie inside or on the boundary of Ω\Omega. Moreover, the infinity norms of these QIs are small and do not depend on the triangulation: as the two QIs are exact on quadratic polynomials, they give the optimal approximation order for smooth functions. Our analysis is done for ff and its partial derivatives of the first and second orders and a particular effort has been made in order to give the best possible error bounds in terms of the smoothness of ff and of the mesh ratios of the triangulation

    C2 piecewise cubic quasi-interpolants on a 6-direction mesh

    Get PDF
    We study two kinds of quasi-interpolants (abbr. QI) in the space of C2 piecewise cubics in the plane, or in a rectangular domain, endowed with the highly symmetric triangulation generated by a uniform 6-direction mesh. It has been proved recently that this space is generated by the integer translates of two multi-box splines. One kind of QIs is of differential type and the other of discrete type. As those QIs are exact on the space of cubic polynomials, their approximation order is 4 for sufficiently smooth functions. In addition, they exhibit nice superconvergent properties at some specific points. Moreover, the infinite norms of the discrete QIs being small, they give excellent approximations of a smooth function and of its first order partial derivatives. The approximation properties of the QIs are illustrated by numerical examples
    • …
    corecore