572 research outputs found

    Near-best bivariate spline quasi-interpolants on a four-directional mesh of the plane

    No full text
    Spline quasi-interpolants (QIs) are practical and effective approximation operators. In this paper, we construct QIs with optimal approximation orders and small infinity norms called near-best discrete and integral quasi-interpolants which are based on Ω\Omega-~splines, i.e. B-splines with regular lozenge supports on the uniform four directional mesh of the plane. These quasi-interpolants are obtained so as to be exact on some space of polynomials and to minimize an upper bound of their infinity norms which depend on a finite number of free parameters. We show that this problem has always a solution, which is not unique in general. Concrete examples of these types of quasi-interpolants are given in the last section

    Recursive subdivision algorithms for curve and surface design

    Get PDF
    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

    The Argyris isogeometric space on unstructured multi-patch planar domains

    Full text link
    Multi-patch spline parametrizations are used in geometric design and isogeometric analysis to represent complex domains. We deal with a particular class of C0C^0 planar multi-patch spline parametrizations called analysis-suitable G1G^1 (AS-G1G^{1}) multi-patch parametrizations (Collin, Sangalli, Takacs; CAGD, 2016). This class of parametrizations has to satisfy specific geometric continuity constraints, and is of importance since it allows to construct, on the multi-patch domain, C1C^1 isogeometric spaces with optimal approximation properties. It was demonstrated in (Kapl, Sangalli, Takacs; CAD, 2018) that AS-G1G^1 multi-patch parametrizations are suitable for modeling complex planar multi-patch domains. In this work, we construct a basis, and an associated dual basis, for a specific C1C^1 isogeometric spline space W\mathcal{W} over a given AS-G1G^1 multi-patch parametrization. We call the space W\mathcal{W} the Argyris isogeometric space, since it is C1C^1 across interfaces and C2C^2 at all vertices and generalizes the idea of Argyris finite elements to tensor-product splines. The considered space W\mathcal{W} is a subspace of the entire C1C^1 isogeometric space V1\mathcal{V}^{1}, which maintains the reproduction properties of traces and normal derivatives along the interfaces. Moreover, it reproduces all derivatives up to second order at the vertices. In contrast to V1\mathcal{V}^{1}, the dimension of W\mathcal{W} does not depend on the domain parametrization, and W\mathcal{W} admits a basis and dual basis which possess a simple explicit representation and local support. We conclude the paper with some numerical experiments, which exhibit the optimal approximation order of the Argyris isogeometric space W\mathcal{W} and demonstrate the applicability of our approach for isogeometric analysis

    08221 Abstracts Collection -- Geometric Modeling

    Get PDF
    From May 26 to May 30 2008 the Dagstuhl Seminar 08221 ``Geometric Modeling\u27\u27 was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available

    Hermite type Spline spaces over rectangular meshes with complex topological structures

    Get PDF
    International audienceMotivated by the magneto hydrodynamic (MHD) simulation for Tokamaks with Isogeometric analysis, we present a new type of splines defined over a rectangular mesh with arbitrary topology, which are piecewise polynomial functions of bidegree (d,d) and C^r parameter continuity. In particular, We compute their dimension and exhibit basis functions called Hermite bases for bicubic spline spaces. We investigate their potential applications for solving partial differential equations (PDEs) over a complex physical domain in the framework of Isogeometric analysis. In particular, weanalyze the property of approximation of these spline spaces for the L2-norm. Despite the fact that the basis functions are singular at extraordinary vertices, we show that the optimal approximation order and numerical convergence rates are reached by setting a proper parameterization

    Optimization on Spaces of Curves

    Get PDF
    • …
    corecore