Related papers: Locally generated $\mathcal{C}^1$-splines over tri…
The paper deals with two fundamental types of trigonometric polynomials and splines on uniform grids, which allow us to construct interpolation approximations that depend linearly on the values of the interpolated function. Fundamental on…
We solve the following problem: given a polynomial of order $n$ and the corresponding $B\'ezier$ tensor product patches over an unstructured regular quadrilateral mesh of any valence, find a solution to the $G^{1}1$ or $C^{1}1$…
The notions of discrete conformality on triangle meshes have rich mathematical theories and wide applications. The related notions of discrete uniformizations on triangle meshes, suggest efficient methods for computing the uniformizations…
Functions on a bounded domain in scientific computing are often approximated using piecewise polynomial approximations on meshes that adapt to the shape of the geometry. We study the problem of function approximation using splines on a…
Let $V$ be a vector space over a finite field $k$. We give a condition on a subset $A \subset V$ that allows for a local criterion for checking when a function $f:A \to k$ is a restriction of a polynomial function of degree $<m$ on $V$. In…
We construct a family of monotone and convex $C^1$ integro cubic splines under a strictly convex position of the dataset. Then, we find an optimal spline by considering its approximation properties. Finally, we give some examples to…
Spline functions have long been used in numerical solution of differential equations. Recently it revives as isogeometric analysis, which offers integration of finite element analysis and NURBS based CAD into a single unified process.…
This paper presents a spline-based parameterisation framework for plane graphs. The plane graph is characterised by a collection of curves forming closed loops that fence-off planar faces which have to be parameterised individually. Hereby,…
In this paper, we consider $C^1$ cubic Powell-Sabin splines for the numerical solution of boundary value problems on planar and spatial surface domains. We first review the construction and basic properties of polynomial and rational $C^1$…
We construct over a given bilinear multi-patch domain a novel $C^s$-smooth mixed degree and regularity isogeometric spline space, which possesses the degree $p=2s+1$ and regularity $r=s$ in a small neighborhood around the edges and…
The design of globally $C^s$-smooth ($s \geq 1$) isogeometric spline spaces over multi-patch geometries is a current and challenging topic of research in the framework of isogeometric analysis. In this work, we extend the recent methods…
We present an algorithm to compute best least-squares approximations of discrete real-valued functions by first-degree splines (broken lines) with free knots. We demonstrate that the algorithm delivers after a finite number of steps a…
We develop a local polynomial spline interpolation scheme for arbitrary spline order on bounded intervals. Our method's local formulation, effective boundary considerations and optimal interpolation error rate make it particularly useful…
This paper addresses the linear independence of T-splines that correspond to refinements of three-dimensional tensor-product meshes. We give an abstract definition of analysis-suitability, and prove that it is equivalent to…
We prove that the linearization of a germ of holomorphic map of the type $F_\lambda(z)=\lambda(z+O(z^2))$ has a $ C^1$--holomorphic dependence on the multiplier $\lambda$. $C^1$--holomorphic functions are $ C^1$--Whitney smooth functions,…
We show that on a Riemann surface lamination locally embedded in $\mathbb{C}^2$, $C^1$ functions (in the sense of the $C^1$ structure of the lamination) are uniform limits of ambient $C^1$ functions, with $L^p$ control on the derivatives…
Several results on constrained spline smoothing are obtained. In particular, we establish a general result, showing how one can constructively smooth any monotone or convex piecewise polynomial function (ppf) (or any $q$-monotone ppf,…
A spline is an assignment of polynomials to the vertices of a graph, where the difference of two polynomials along an edge must belong to the ideal labeling that edge. We consider a ring of splines $\mathcal{M}_{H}$ constructed on a graph…
A method is proposed for constructing a spline curve of the Bezier type, which is continuous along with its first derivative by a piecewise polynomial function. Conditions for its existence and uniqueness are given. The constructed curve…
In this paper we investigate the problem of interpolating a B-spline curve network, in order to create a surface satisfying such a constraint and defined by blending functions spanning the space of bivariate $C^1$ quadratic splines on…