Modified form of binary and ternary 3-point subdivision schemes

Binary 3-point scheme, developed by Hormann and Sabin [Hormann, K. and Sabin, Malcolm A., 2008, A family of subdivision schemes with cubic precision, Computer Aided Geometric Design, 25, 41-52], has been modified by introducing a tension parameter which generates a family of C¹ limiting curves for certain range of tension parameter. Ternary 3-point scheme, introduced by Siddiqi and Rehan [Siddiqi, Shahid S. and Rehan, K., 2009, A ternary three point scheme for curve designing, International Journal of Computer Mathematics, In Press, DOI: 10.1080/00207160802428220], has also been modified by introducing a tension parameter which generates family of C¹ and C² limiting curves for certain range of tension parameter. Laurent polynomial method is used to investigate the continuity of the subdivision schemes. The performance of modified schemes has been demonstrated by considering different examples along with its comparison with the established subdivision schemes.     

Hermite subdivision with shape constraints on a rectangular mesh

In 1999, Dubuc and Merrien introduced a Hermite subdivision scheme which gives C ¹-interpolants on a rectangular mesh. In this paper a two parameter version of this scheme is analyzed, and C ¹-convergence is proved for a range of the two parameters. By introducing a control grid the parameters in the scheme can be chosen so that the interpolant inherits positivity and/or directional monotonicity from the initial data. Several examples are given showing that a desired shape can be achieved even if only very crude estimates for the initial slopes are used. AMS subject classification (2000) 65D05, 65D17     

Hermite Subdivision Schemes and Taylor Polynomials

We propose a general study of the convergence of a Hermite subdivision scheme ℋ of degree d>0 in dimension 1. This is done by linking Hermite subdivision schemes and Taylor polynomials and by associating a so-called Taylor subdivision (vector) scheme . The main point of investigation is a spectral condition. If the subdivision scheme of the finite differences of is contractive, then is C ⁰ and ℋ is C ^d . We apply this result to two families of Hermite subdivision schemes. The first one is interpolatory; the second one is a kind of corner cutting. Both of them use the Tchakalov-Obreshkov interpolation polynomial.      

Nonlinear Subdivision Schemes on Irregular Meshes

The present article deals with convergence and smoothness analysis of geometric, nonlinear subdivision schemes in the presence of extraordinary points. We discuss when the existence of a proximity condition between a linear scheme and its nonlinear analogue implies convergence of the nonlinear scheme (for dense enough input data). Furthermore, we obtain C ¹ smoothness of the nonlinear limit function in the vicinity of an extraordinary point over Reif’s characteristic parametrization. The results apply to the geometric analogues of well-known subdivision schemes such as Doo–Sabin or Catmull–Clark schemes.     

Matrix-valued symmetric templates for interpolatory surface subdivisions: I. Regular vertices

The objective of this paper is to introduce a general procedure for deriving interpolatory surface subdivision schemes with “symmetric subdivision templates” (SSTs) for regular vertices. While the precise definition of “symmetry” will be clarified in the paper, the property of SSTs is instrumental to facilitate application of the standard procedure for finding symmetric weights for taking weighted averages to accommodate extraordinary (or irregular) vertices in surface subdivisions, a topic to be studied in a continuation paper. By allowing the use of matrices as weights, the SSTs introduced in this paper may be constructed to overcome the size barrier limited to scalar-valued interpolatory subdivision templates, and thus avoiding the unnecessary surface oscillation artifacts. On the other hand, while the old vertices in a (scalar) interpolatory subdivision scheme do not require a subdivision template, we will see that this is not the case for the matrix-valued setting. Here, we employ the same definition of interpolation subdivisions as in the usual scalar consideration, simply by requiring the old vertices to be stationary in the definition of matrix-valued interpolatory subdivisions. Hence, there would be another complication when the templates are extended to accommodate extraordinary vertices if the template sizes are not small. In this paper, we show that even for C² interpolatory subdivisions, only one “ring” is sufficient in general, for both old and new vertices. For example, for 1-to-4 split C² interpolatory surface subdivisions, we obtain matrix-valued symmetric interpolatory subdivision templates (SISTs) for both triangular and quadrilateral meshes with sizes that agree with those of the Loop and Catmull–Clark schemes, respectively. Matrix-valued SISTs of similar sizes are also constructed for C² interpolatory and subdivision schemes in this paper. In addition to small template sizes, an obvious feature of matrix-valued weights is the flexibility for introducing shape-control parameters. Another significance is that, in contrast to the usual scalar setting, matrix-valued SISTs can be formulated in terms of the coefficient sequence of some vector refinement equation of interpolating bivariate C² splines with small support. For example, by modifying the spline function vectors introduced in our previous work [C.K. Chui, Q.T. Jiang, Surface subdivision schemes generated by refinable bivariate spline function vectors, Appl. Comput. Harmon. Anal. 15 (2003) 147–162; C.K. Chui, Q.T. Jiang, Refinable bivariate quartic and quintic C²-splines for quadrilateral subdivisions, Preprint, 2004], C² symmetric interpolatory subdivision schemes associated with refinement equations of C² cubic and quartic splines on the 6-directional and 4-directional meshes, respectively, are also constructed in this paper.     

Smoothness of Stationary Subdivision on Irregular Meshes

We derive necessary and sufficient conditions for tangent plane and C ^k -continuity of stationary subdivision schemes near extraordinary vertices. Our criteria generalize most previously known conditions. We introduce a new approach to analysis of subdivision surfaces based on the idea of the universal surface . Any subdivision surface can be locally represented as a projection of the universal surface, which is uniquely defined by the subdivision scheme. This approach provides us with a more intuitive geometric understanding of subdivision near extraordinary vertices. February 16, 1998. Date revised: January 27, 1999. Date accepted: April 2, 1999.     

Helix splines as an example of affine Tchebycheffian splines

The present paper summarizes the theory of affine Tchebycheffian splines and presents an interesting affine Tchebycheffian free-form scheme, the “helix scheme”. The curve scheme provides exact representations of straight lines, circles and helix curves in an arc length parameterization. The corresponding tensor product surfaces contain helicoidal surfaces, surfaces of revolution and patches on all types of quadrics. We also show an application to the construction of planarC ² motions interpolating a given set of positions. Because the spline curve segments are calculated using a subdivision algorithm, many algorithms, which are of fundamental importance in the B-spline technique, can be applied to helix splines as well. This paper should demonstrate how to create an affine free-form scheme fitting to certain special applications.     

Using Laurent polynomial representation for the analysis of non‐uniform binary subdivision schemes

Non‐uniform binary linear subdivision schemes, with finite masks, over uniform grids, are studied. A Laurent polynomial representation is suggested and the basic operations required for smoothness analysis are presented. As an example it is shown that the interpolatory 4‐point scheme is C ¹ with an almost arbitrary non‐uniform choice of the free parameter. This revised version was published online in June 2006 with corrections to the Cover Date.     

Stability and convergence for a complete model of mass diffusion

We propose a fully discrete scheme for approximating a three-dimensional, strongly nonlinear model of mass diffusion, also called the complete Kazhikhov–Smagulov model. The scheme uses a C⁰ finite-element approximation for all unknowns (density, velocity and pressure), even though the density limit, solution of the continuous problem, belongs to H². A first-order time discretization is used such that, at each time step, one only needs to solve two decoupled linear problems for the discrete density and the velocity–pressure, separately.We extend to the complete model, some stability and convergence results already obtained by the last two authors for a simplified model where λ²-terms are not considered, λ being the mass diffusion coefficient. Now, different arguments must be introduced, based mainly on an induction process with respect to the time step, obtaining at the same time the three main properties of the scheme: an approximate discrete maximum principle for the density, weak estimates for the velocity and strong ones for the density. Furthermore, the convergence towards a weak solution of the density-dependent Navier–Stokes problem is also obtained as λ→0 (jointly with the space and time parameters).Finally, some numerical computations prove the practical usefulness of the scheme.     

Shape-preserving interpolation by splines using vector subdivision

We give a local convexity preserving interpolation scheme using parametricC ² cubic splines with uniform knots produced by a vector subdivision scheme which simultaneously provides the function and its first and second order derivatives. This is also adapted to give a scheme which is both local convexity and local monotonicity preserving when the data values are strictly increasing in thex-direction.     

Convergent Vector and Hermite Subdivision Schemes

Hermite subdivision schemes have been studied by Merrien, Dyn, and Levin and they appear to be very different from subdivision schemes analyzed before since the rules depend on the subdivision level. As suggested by Dyn and Levin, it is possible to transform the initial scheme into a uniform stationary vector subdivision scheme which can be handled more easily.With this transformation, the study of convergence of Hermite subdivision schemes is reduced to that of vector stationary subdivision schemes. We propose a first criterion for C⁰-convergence for a large class of vector subdivision schemes. This gives a criterion for C¹-convergence of Hermite subdivision schemes. It can be noticed that these schemes do not have to be interpolatory. We conclude by investigating spectral properties of Hermite schemes and other necessary/sufficient conditions of convergence.     

Square root 3 -Subdivision Schemes: Maximal Sum Rule Orders

   Abstract. Subdivision with finitely supported masks is an efficient method to create discrete multiscale representations of smooth surfaces for CAGD applications. Recently a new subdivision scheme for triangular meshes, called

A family of Hermite interpolants by bisection algorithms

A two point subdivision scheme with two parameters is proposed to draw curves corresponding to functions that satisfy Hermite conditions on [a, b]. We build two functionsf andf ¹ on dyadic numbers and for some values of the parameters,f is in ¹ withf ¹=f. Examples are provided which show how different the curves can be.     

An interpolation theorem for holomorphic automorphisms ofC n

We construct automorphisms of C ⁿ which map certain discrete sequences one onto another with prescribed finite jet at each point, thus solving a general Mittag-Leffler interpolation problem for automorphisms. Under certain circumstances, this can be done while also approximating a given automorphism on a compact set.     

Taylorian fields and subdivision algorithms

Some recents papers [3,8] provide a new approach for the concept of subdivision algorithms, widely used in CAGD: they develop the idea of interpolatory subdivision schemes for curves. In this paper, we show how the old results of H. Whitney [13,14] on Taylorian fields giving necessary and sufficient conditions for a function to be of classC ^k on a compact provide also necessary and sufficient conditions which can be used to construct interpolatory subdivision schemes, in order to obtain, at the limit, aC ¹ (orC ^k ,k>1 eventually) function. Moreover, we give general results for the approximation properties of these schemes, and error bounds for the approximation of a given function.     

Convergence and smoothness analysis of subdivision rules in Riemannian and symmetric spaces

After a discussion on definability of invariant subdivision rules we discuss rules for sequential data living in Riemannian manifolds and in symmetric spaces, having in mind the space of positive definite matrices as a major example. We show that subdivision rules defined with intrinsic means in Cartan-Hadamard manifolds converge for all input data, which is a much stronger result than those usually available for manifold subdivision rules. We also show weaker convergence results which are true in general but apply only to dense enough input data. Finally we discuss C ¹ and C ² smoothness of limit curves.     

On the h-vector of a cohen-macaulay domain in positive characteristic

Here we study the Hilbert function of a Cohen-Macaulay homogeneous domain over an algebraically closed field of positive characteristic. The main tool (and an essential part of the main geometrical results) is the study of the Hilbert function of a general hyperplane section X?P ^r of an integral curve C?P ^r+1 , which is pathological in some sense. In §1, we study the case when Cis a strange curve, i.e., all tangent lines to Cat its simple points pass through a fixed point υ∈P ^r+1 . In §2, we give more refined results under the assumption that the Trisecant Lemma fails for C, i.e., any line spanned by two points of Ccontains one more point of C.     

Regularity of Irregular Subdivision

We study the smoothness of the limit function for one-dimensional unequally spaced interpolating subdivision schemes. The new grid points introduced at every level can lie in irregularly spaced locations between old, adjacent grid points and not only midway as is usually the case. For the natural generalization of the four-point scheme introduced by Dubuc and Dyn, Levin, and Gregory, we show that, under some geometric restrictions, the limit function is always C ¹ ; under slightly stronger restrictions we show that the limit function is almost C ² , the same regularity as in the regularly spaced case. May 27, 1997. Date revised: March 10, 1998. Date accepted: March 28, 1998.     

High-order discrete-time orthogonal spline collocation methods for singularly perturbed 1D parabolic reaction–diffusion problems

Quasi-optimal error estimates are derived for the continuous-time orthogonal spline collocation (OSC) method and also two discrete-time OSC methods for approximating the solution of 1D parabolic singularly perturbed reaction–diffusion problems. OSC with C¹ splines of degree r ≥ 3 on a Shishkin mesh is employed for the spatial discretization while the Crank–Nicolson method and the BDF2 scheme are considered for the time-stepping. The results of numerical experiments validate the theoretical analysis and also exhibit additional quasi-optimal results, in particular, superconvergence phenomena.