Bivariate Hermite subdivision

A subdivision scheme for constructing smooth surfaces interpolating scattered data in $\mathbb{R}^3$ is proposed. It is also possible to impose derivative constraints in these points. In the case of functional data, i.e., data are given in a properly triangulated set of points $\{(x_i, y_i)\}_{i=1}^N$ from which none of the pairs $(x_i,y_i)$ and $(x_j,y_j)$ with $i\neq j$ coincide, it is proved that the resulting surface (function) is $C^1$. The method is based on the construction of a sequence of continuous splines of degree 3. Another subdivision method, based on constructing a sequence of splines of degree 5 which are once differentiable, yields a function which is $C^2$ if the data are not 'too irregular'. Finally the approximation properties of the methods are investigated

Construction of a VC1 interpolant over triangles via edge deletion

We present a construction of a visually smooth surface which interpolates to position values and normal vectors of randomly distributed points on a 3D object. The method is local and uses quartic triangular and bicubic quadrilateral patches without splits. It heavily relies on an edge deleting algorithm which, starting from a given triangulation, derives a suitable combination of three- and four sided patches

Bounds for bounded motion around a perturbed fixed point

We consider a dissipative map of the plane with a bounded perturbation term. This perturbation represents e.g. an extra time dependent term, a coupling to another system or noise. The unperturbed map has a spiral attracting fixed point. We derive an analytical/numerical method to determine the effect of the additional term on the phase portrait of the original map, as a function of the δ bound on the perturbation. This method yields a value δ c such that for δδ c the orbits about the attractor are certainly bounded. In that case we obtain a largest region in which all orbits remain bounded and a smallest region in which these bounded orbits are captured after some time (the analogue of 'basin' and 'attractor respectively')

Fixed point iteration on pointsymmetric interference graphs

Interference graphs are used for performance analysis of multiprocessor interconnection networks. In order to model blocked transmissions, nodes can have three states: idle, active or blocked. The resulting steady state probability distribution has a non-product form. Macro states are introduced to calculate performance measures, and the corresponding macro state probability distribution is approximated by a special type of fixed point iteration: the macro approximation, which is very efficient for pointsymmetric interference graphs

Complexes of block copolymers in solution: tree approximation

We determine the statistical properties of block copolymer complexes in solution. These complexes are assumed to have the topological structure of (i) a tree or of (ii) a line-dressed tree. In case the structure is that of a tree, the system is shown to undergo a gelation transition at sufficiently high polymer concentration. However, if the structure is that of a line-dressed tree, this transition is absent. Hence, we show the assumption about the topological structure to be relevant for the statistical properties of the system. We determine the average size of the complexes and calculate the viscosity of the system under the assumption that the complexes geometrically can be treated as porous spheres

Transient periodic behaviour related to a saddle-node bifurcation

The authors investigate transient periodic orbits of dissipative invertible maps of R2. Such orbits exist just before, in parameter space, a saddle-node pair is formed. They obtain numerically and analytically simple scaling laws for the duration of the transient, and for the region of initial conditions which evolve into transient periodic orbits. An estimate of this region is then obtained by the construction-after extension of the map to C2-of the stable manifolds of the two complex saddles in C2 that bifurcate ino the real saddle-node pai

Convexity preservation of the four-point interpolatory subdivision scheme

In this note we examine the convexity preserving properties of the (linear) four-point interpolatory subdivision scheme of Dyn, Gregory and Levin when applied to functional univariate strictly-convex data. Conditions on the tension parameter guaranteeing preservation of convexity are derived. These conditions depend on the initial data. The resulting scheme is the four-point scheme with tension parameter bounded from above by a bound smaller than $1/16$. Thus the scheme generates $C^1$ limit functions and has approximation order two

Hermite-interpolatory subdivision schemes

Stationary interpolatory subdivision schemes for Hermite data that consist of function values and first derivatives are examined. A general class of Hermite-interpolatory subdivision schemes is proposed, and some of its basic properties are stated. The goal is to characterise and construct certain classes of nonlinear (and linear) Hermite schemes. For linear Hermite subdivision, smoothness conditions known from the literature are discussed. In order to allow a simpler construction of suitable nonlinear Hermite subdivision schemes, these conditions are posed as assumptions. For linear Hermite subdivision, explicit schemes that satisfy sufficient conditions for $C^2$-convergence are constructed. This leads to larger classes of $C^2$ schemes than known from the literature. Finally, convexity preserving Hermite-interpolatory subdivision is examined, and some explicit rational schemes that generate $C^1$ limit functions are presented

On Flips in Polyhedral Surfaces: a new development

Let V be a finite point set in 3D and let ST(V ) be the set of closed triangulated polyhedral surfaces with a vertex set V. Those surfaces can be dened as 2:5D (closed) triangulations of the given discrete data set V. We generalise the operation of diagonal flip for 2:5D triangulations by omitting the usual restriction that the flip operation should not produce a self-intersecting triangulation. We denote this flip operation by EDF (extended diagonal flip). Among all possible 2:5D triangulations with the vertex set V we first single out those that are topologically equivalent to the 2D sphere. We show that any two such 2:5D triangulations (if V is situated in general position), are equivalent under EDF, i.e., they can be transformed into each other via a finite sequence of EDF