We investigate univariate and bivariate binary subdivision schemes based on cubic B-splines with double knots. It turns out that double knots change the behaviour of a uniform cubic scheme from primal to dual. We focus on the analysis of new bivariate cubic schemes with double knots at extraordinary points. These cubic schemes produce C surfaces with the original Doo-Sabin weights.

We analyze an alternative to classical Zernike fitting based on the cubic B-spline model, and compare the strengths and weaknesses of each representation over a set of different wavefronts that cover a wide range of shape complexity. The results obtained show that a Zernike low-degree polynomial expansion or a cubic B-spline with a low number of breakpoints are the best choices for fitting simp...

In this paper fuzzy piecewise cubic interpolation is constructed for fuzzy data based on B-spline basis functions. We add two new additional conditions which guarantee uniqueness of fuzzy B-spline interpolation.Other conditions are imposed on the interpolation data to guarantee that the interpolation function to be a well-defined fuzzy function. Finally some examples are given to illustrate the...

The goal of this study is to develop a matching algorithm that can handle large geometric changes in x-ray computed tomography (CT)-derived lung geometry occurring during deep breath maneuvers. These geometric relationships are further utilized to build a dynamic lung airway model for computational fluid dynamics (CFD) studies of pulmonary air flow. The proposed algorithm is based on a cubic B-...

The b-chromatic number of a graph G is the largest integer k such that G admits a proper k-coloring in which every color class contains at least one vertex adjacent to some vertex in all the other color classes. It is proved that with four exceptions, the b-chromatic number of cubic graphs is 4. The exceptions are the Petersen graph, K3,3, the prism over K3, and one more sporadic example on 10 ...

This paper proposes an algorithm for generating irreducible cubic trinomials in the form x + ax + b, b ∈ Fp, where a is a certain fixed non-zero element in the prime field Fp. The proposed algorithm needs a certain irreducible cubic trinomial over Fp to be previously given as a generator; however, the proposed algorithm can generate irreducible cubic polynomials one after another by changing a ...

We present a method for tabulating all cubic function fields over Fq(t) whose discriminant D has either odd degree or even degree and the leading coefficient of −3D is a non-square in Fq , up to a given bound B on deg(D). Our method is based on a generalization of Belabas’ method for tabulating cubic number fields. The main theoretical ingredient is a generalization of a theorem of Davenport an...

Based on the matrix perturbation technique. a fast-fitting algorithm using uniform cubic B-spline curves is presented. Our algorithm entails much less floating-point operations when compared with Gaussian elimination method. In addition, our result can be applied to solve the closed cubic B-spline curve-fitting problem. Experimental results are included for a practical version. These experiment...