A T-mesh is basically a rectangular grid that allows T-junctions. In this paper, we propose a method based on Bézier nets to calculate the dimension of a spline function space over a T-mesh. When the order of the smoothness is less than half of the degree of the spline functions, a dimension formula is derived which involves only the topological quantities of the T-mesh. The construction of bas...

We use the bivariate spline method to solve the time evolution Navier-Stokes equations numerically. The bivariate spline we use in this paper is the spline space of smoothness r and degree 3r over triangulated quadrangulations. The stream function formulation for the Navier-Stokes equations is employed. Galerkin's method is applied to discretize the space variables of the nonlinear fourth order...

By simultaneously considering evolution processes for parametric spline curves and implicitly defined curves, we formulate the framework of dual evolution. This allows us to combine the advantages of both representations. On the one hand, the implicit representation is used to guide the topology of the parametric curve and to formulate additional constraints, such as range constraints. On the o...

a r t i c l e i n f o a b s t r a c t Keywords: Quadrature amplitude modulation Peak-to-average power ratio Nonlinear high power amplifier Hammerstein channel B-spline neural network Equalization High bandwidth-efficiency quadrature amplitude modulation (QAM) signaling widely adopted in high-rate communication systems suffers from a drawback of high peak-to-average power ratio, which may cause ...

In this paper we propose a strategy for generating consistent hierarchical T–meshes which allow local refinement and offer a way to obtain spline basis functions with highest order smoothness incrementally. We describe the required ordering of line–segments during refinement and the construction of spline basis functions. We give our strategy for generating consistent hierarchical T–meshes over...

Chaiken's algorithm is a procedure for inserting new knots into uniform quadratic Bspline curves by doubling the control points and taking two successive averages. Lane and Riesenfeld showed that Chaiken's algorithm extends to uniform B-spline curves of arbitrary degree. By generalizing the notion of successive averaging, we further extend Chaiken's algorithm to B-spline curves of arbitrary deg...

Based on the local refinement algorithm addressed in [18], we analyze the linear independence of the bi-cubic T-spline blending functions corresponding to particular T-meshes.

In this paper, We use the wavelet bases of Hermite cubic splines to solve the second kind integral equations xCi) -11 K(t,s)x(s)ds = y(t), t E [0,1]. A pair of wavelets are constructed on the basis of Hermite cubic spline~: This wavelets are in C1 and supported on [0,2]. Moreover, one wavelet is symmetric, and the other is anti-symmetric. This spline wavelets are then adapted to the interval [0...

We present a new method based on B-spline snakes (active contours) for measuring high-accuracy contact angles. In this approach, we avoid making physical assumptions by defining the contour of the drop as a versatile B-spline curve. When useful, we extend this curve by mirror symmetry so that we can take advantage of the reflection of the drop onto the substrate to detect the position of the co...