1,438 research outputs found

    A subdivision-based implementation of non-uniform local refinement with THB-splines

    Get PDF
    Paper accepted for 15th IMA International Conference on Mathematics on Surfaces, 2017. Abstract: Local refinement of spline basis functions is an important process for spline approximation and local feature modelling in computer aided design (CAD). This paper develops an efficient local refinement method for non-uniform and general degree THB-splines(Truncated hierarchical B-splines). A non-uniform subdivision algorithm is improved to efficiently subdivide a single non-uniform B-spline basis function. The subdivision scheme is then applied to locally hierarchically refine non-uniform B-spline basis functions. The refined basis functions are non-uniform and satisfy the properties of linear independence, partition of unity and are locally supported. The refined basis functions are suitable for spline approximation and numerical analysis. The implementation makes it possible for hierarchical approximation to use the same non-uniform B-spline basis functions as existing modelling tools have used. The improved subdivision algorithm is faster than classic knot insertion. The non-uniform THB-spline approximation is shown to be more accurate than uniform low degree hierarchical local refinement when applied to two classical approximation problems

    Polynomial-based non-uniform interpolatory subdivision with features control

    Get PDF
    Starting from a well-known construction of polynomial-based interpolatory 4-point schemes, in this paper we present an original affine combination of quadratic polynomial samples that leads to a non-uniform 4-point scheme with edge parameters. This blending-type formulation is then further generalized to provide a powerful subdivision algorithm that combines the fairing curve of a non-uniform refinement with the advantages of a shape-controlled interpolation method and an arbitrary point insertion rule. The result is a non-uniform interpolatory 4-point scheme that is unique in combining a number of distinctive properties. In fact it generates visually-pleasing limit curves where special features ranging from cusps and flat edges to point/edge tension effects may be included without creating undesired undulations. Moreover such a scheme is capable of inserting new points at any positions of existing intervals, so that the most convenient parameter values may be chosen as well as the intervals for insertion. Such a fully flexible curve scheme is a fundamental step towards the construction of high-quality interpolatory subdivision surfaces with features control

    Subdivision surfaces with creases and truncated multiple knot lines

    Get PDF
    We deal with subdivision schemes based on arbitrary degree B-splines. We focus on extraordinary knots which exhibit various levels of complexity in terms of both valency and multiplicity of knot lines emanating from such knots. The purpose of truncated multiple knot lines is to model creases which fair out. Our construction supports any degree and any knot line multiplicity and provides a modelling framework familiar to users used to B-splines and NURBS systems

    Fast Isogeometric Boundary Element Method based on Independent Field Approximation

    Full text link
    An isogeometric boundary element method for problems in elasticity is presented, which is based on an independent approximation for the geometry, traction and displacement field. This enables a flexible choice of refinement strategies, permits an efficient evaluation of geometry related information, a mixed collocation scheme which deals with discontinuous tractions along non-smooth boundaries and a significant reduction of the right hand side of the system of equations for common boundary conditions. All these benefits are achieved without any loss of accuracy compared to conventional isogeometric formulations. The system matrices are approximated by means of hierarchical matrices to reduce the computational complexity for large scale analysis. For the required geometrical bisection of the domain, a strategy for the evaluation of bounding boxes containing the supports of NURBS basis functions is presented. The versatility and accuracy of the proposed methodology is demonstrated by convergence studies showing optimal rates and real world examples in two and three dimensions.Comment: 32 pages, 27 figure
    corecore