394 research outputs found
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
Recommended from our members
A 10-point interpolatory recursive subdivision algorithm for the generation of parametric surfaces
In this paper, an interpolatory subdivision algorithm for surfaces over arbitrary triangulations is introduced and its properties over uniform triangulations studied. The Butterfly Scheme, which is introduced by Dyn, Gregory and Levin is a special case of this algorithm. In our analysis, the matrix approach is employed and the idea of "Cross Difference of Directional Divided Difference" analysis is presented. This method is a generalization of the technique used by Dyn, Gregory and Levin etc. to analyse univariate subdivision algorithms. It is proved that the algorithm produces smooth surfaces provided the shape parameters are kept within an appropriate range
Curve network interpolation by quadratic B-spline surfaces
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 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
Recursive subdivision algorithms for curve and surface design
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.In this thesis, the author studies recursIve subdivision algorithms for curves and surfaces. Several subdivision algorithms are constructed and investigated. Some graphic examples are also presented.
Inspired by the Chaikin's algorithm and the Catmull-Clark's algorithm, some non-uniform schemes, the non-uniform corner cutting scheme and the recursive subdivision algorithm for non-uniform B-spline curves, are constructed and analysed. The adapted parametrization is introduced to analyse these non-uniform algorithms. In order to solve the surface interpolation problem, the Dyn-Gregory-Levin's 4-point interpolatory scheme is generalized to surfaces and the 10-point interpolatory subdivision scheme for surfaces is formulated. The so-called Butterfly Scheme, which was firstly introduced by Dyn, Gregory Levin in 1988, is just a special case of the scheme. By studying the Cross-Differences of Directional Divided Differences, a matrix approach for analysing uniform subdivision algorithms for surfaces is established and the convergence of the 10-point scheme over both uniform and non-uniform triangular networks is studied. Another algorithm, the subdivision algorithm for uniform bi-quartic B-spline surfaces over arbitrary topology is introduced and investigated. This algorithm is a generalization of Doo-Sabin's and Catmull-Clark's algorithms. It produces uniform Bi-quartic B-spline patches over uniform data. By studying the local subdivision matrix, which is a circulant, the tangent plane and curvature properties of the limit surfaces at the so-called Extraordinary Points are studied in detail.The Chinese Educational Commission and The British Council (SBFSS/1987
Skewed Factor Models Using Selection Mechanisms
Traditional factor models explicitly or implicitly assume that the factors follow a multivariate normal distribution; that is, only moments up to order two are involved. However, it may happen in real data problems that the first two moments cannot explain the factors. Based on this motivation, here we devise three new skewed factor models, the skew-normal, the skew-t, and the generalized skew-normal factor models depending on a selection mechanism on the factors. The ECME algorithms are adopted to estimate related parameters for statistical inference. Monte Carlo simulations validate our new models and we demonstrate the need for skewed factor models using the classic open/closed book exam scores dataset
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
Recommended from our members
A Comparison of Interpolation Methods for Sparse Data: Application to Wind and Concentration Fields
In order to produce gridded fields of pollutant concentration data and surface wind data for use in an air quality model, a number of techniques for interpolating sparse data values are compared. The techniques are compared using three data sets. One is an idealized concentration distribution to which the exact solution is known, the second is a potential flow field, while the third consists of surface ozone concentrations measured in the Los Angeles Basin on a particular day. The results of the study indicate that fitting a second-degree polynomial to each subregion (triangle) in the plane with each data point weighted according to its distance from the subregion provides a good compromise between accuracy and computational cost
Best data-dependent triangulations
AbstractWhen reconstructing a surface from irregularly spaced data we need to decide how to identify a good triangulation. As a measure of quality we consider various differential geometrical properties, namely integral absolute Gaussian curvature, integral absolute mean curvature and area. A comparison is made with data-dependent triangulation methods that exist in the literature
On a class of polynomial triangular macro-elements
AbstractIn this paper we present a new class of polynomial triangular macro-elements of arbitrary degree which are an extension of the classical Clough-Tocher cubic scheme. Their most important property is that the degree plays the role of a tension parameter, since these macro elements tend to the plane interpolating the vertices data. Graphical examples showing their use in scattered data interpolation are reported
- …