Local RBF approximation for scattered data fitting with bivariate splines

In this paper we continue our earlier research [4] aimed at developing effcient methods of local approximation suitable for the first stage of a spline based two-stage scattered data fitting algorithm. As an improvement to the pure polynomial local approximation method used in [5], a hybrid polynomial/radial basis scheme was considered in [4], where the local knot locations for the RBF terms were selected using a greedy knot insertion algorithm. In this paper standard radial local approximations based on interpolation or least squares are considered and a faster procedure is used for knot selection, signicantly reducing the computational cost of the method. Error analysis of the method and numerical results illustrating its performance are given

A tension approach to controlling the shape of cubic spline surfaces on FVS triangulations

We propose a parametric tensioned version of the FVS macro-element to control the shape of the composite surface and remove artificial oscillations, bumps and other undesired behaviour. In particular, this approach is applied to C1 cubic spline surfaces over a four-directional mesh produced by two-stage scattered data fitting methods

Scattered data fitting on surfaces using projected Powell-Sabin splines

We present C1 methods for either interpolating data or for fitting scattered data associated with a smooth function on a two-dimensional smooth manifold Ω embedded into R3. The methods are based on a local bivariate Powell-Sabin interpolation scheme, and make use of local projections on the tangent planes. The data fitting method is a two-stage method. We illustrate the performance of the algorithms with some numerical examples, which, in particular, confirm the O(h3) order of convergence as the data becomes dens

Interpolation and scattered data fitting on manifolds using projected Powell–Sabin splines

We present methods for either interpolating data or for fitting scattered data on a two-dimensional smooth manifold. The methods are based on a local bivariate Powell-Sabin interpolation scheme, and make use of a family of charts {(Uξ , ξ)}ξ∈ satisfying certain conditions of smooth dependence on ξ. If is a C2-manifold embedded into R3, then projections into tangent planes can be employed. The data fitting method is a two-stage method. We prove that the resulting function on the manifold is continuously differentiable, and establish error bounds for both methods for the case when the data are generated by a smooth function

Adaptive meshless centres and RBF stencils for Poisson equation

We consider adaptive meshless discretisation of the Dirichlet problem for Poisson equation based on numerical differentiation stencils obtained with the help of radial basis functions. New meshless stencil selection and adaptive refinement algorithms are proposed in 2D. Numerical experiments show that the accuracy of the solution is comparable with, and often better than that achieved by the mesh-based adaptive finite element method

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

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

New Models for High-Quality Surface Reconstruction and Rendering

The efficient reconstruction and artifact-free visualization of surfaces from measured real-world data is an important issue in various applications, such as medical and scientific visualization, quality control, and the media-related industry. The main contribution of this thesis is the development of the first efficient GPU-based reconstruction and visualization methods using trivariate splines, i.e., splines defined on tetrahedral partitions. Our methods show that these models are very well-suited for real-time reconstruction and high-quality visualizations of surfaces from volume data. We create a new quasi-interpolating operator which for the first time solves the problem of finding a globally C1-smooth quadratic spline approximating data and where no tetrahedra need to be further subdivided. In addition, we devise a new projection method for point sets arising from a sufficiently dense sampling of objects. Compared with existing approaches, high-quality surface triangulations can be generated with guaranteed numerical stability. Keywords. Piecewise polynomials; trivariate splines; quasi-interpolation; volume data; GPU ray casting; surface reconstruction; point set surface

New Models for High-Quality Surface Reconstruction and Rendering

The efficient reconstruction and artifact-free visualization of surfaces from measured real-world data is an important issue in various applications, such as medical and scientific visualization, quality control, and the media-related industry. The main contribution of this thesis is the development of the first efficient GPU-based reconstruction and visualization methods using trivariate splines, i.e., splines defined on tetrahedral partitions. Our methods show that these models are very well-suited for real-time reconstruction and high-quality visualizations of surfaces from volume data. We create a new quasi-interpolating operator which for the first time solves the problem of finding a globally C1-smooth quadratic spline approximating data and where no tetrahedra need to be further subdivided. In addition, we devise a new projection method for point sets arising from a sufficiently dense sampling of objects. Compared with existing approaches, high-quality surface triangulations can be generated with guaranteed numerical stability. Keywords. Piecewise polynomials; trivariate splines; quasi-interpolation; volume data; GPU ray casting; surface reconstruction; point set surface