GB-spline curves can be considered as the generalization of B-spline curve incorporating a shape parameter into the polynomial basis functions. The geometric effect of the alteration of the shape parameter is discussed in this paper, including constrained shape control of the curve.

The multi-frontal direct solver is the state-of-the-art algorithm for the direct solution of sparse linear systems. This paper provides computational complexity and memory usage estimates for the application of the multifrontal direct solver algorithm on linear systems resulting from B-spline-based isogeometric finite elements, where the mesh is a structured grid. Specifically we provide the es...

In this paper we report on the use of B-Spline lters in perfect reconstruction lter banks. For each polynomial order the analysis and synthesis FIR lters are evaluated, considering the error introduced by lter coe cient truncation, coding quantization and the distortion introduced by the lters themselves. It is shown that B-Spline lters exhibit higher energy concentration in the lower frequency...

Quartic non-polynomial spline function approximation in off step points is developed, for the solution of fourth-order boundary value problems. Using consistency relation of such spline and suitable choice of parameter,we have obtained second, fourth and sixth orders methods. Convergence analysis of sixth order method has been given. The methods are illustrated by some examples, to verify the or...

We propose a matrix approach to the computation of Battle-Lemari e's wavelets. Since the Fourier transform of the scaling function is the product of the inverse F(x) of a square root of a positive trigonometric polynomial and the Fourier transform of a b-spline of order m. The polynomial is the symbol of an bi-innnite matrix B associated with b-spline of order 2m. We approximate B 2m by its nit...

Let 2 be a polyhedral complex embedded in the euclidean space Ed and Sr(2), r ≥ 0, denote the set of all Cr-splines on 2. Then Sr(2) is an R-module where R = E[x1, . . . , xd] is the ring of polynomials in several variables. In this paper we state and prove the existence of an algorithm to write down a free basis for the above R-module in terms of obvious linear forms defining common faces of m...

In this paper, we construct a novel normalized B-spline-like representation for C2-continuous cubic spline space defined on an initial partition refined by inserting two new points inside each sub-interval. The basis functions are compactly supported non-negative that geometrically constructed and form convex of unity. With the help control polynomial theory introduced herein, Marsden identity ...

Conccpts and techniques for thc construction of spline surfaces over irregular meshes are developed and made concrete by exhibiting a family of 0 2 surface splines. These splines extend the B-spline paradigm for the construction of parametric piecewise polynomial surfaces to control_meshe9 with non quadrila.leral cells and mOre or fewer Lhan four cells meeting at a point. In particular, the mes...

B-spline methods have several advantages over Bezier techniques. B-splines are piecewise polynomials that meet smoothly at their common boundaries independent of the location of the control points. This guaranteed smoothness allows designers to use low degree polynomial pieces to construct complicated freeform shapes. In addition, a control point of a B-spline curve or surface has no influence ...

We propose a novel approach for the approximate parameterization of an implicitly defined curve in the plane by polynomial parametric spline curves. The method generates the parameterization of the curve (which may consist of several open and closed branches) without using any a priori information about its topology. If needed the topology of the approximate parameterization can be certified ag...