Related papers: Constructing cartesian splines
Closed formulae for all Gaussian or optimal, 1-parameter quadrature rules in a compact interval [a, b] with non uniform, asymmetric subintervals, arbitrary number of nodes per subinterval for the spline classes $S_{2N, 0}$ and $S_{2N+1,…
In this paper, we investigate $C^2$ super-smoothness of the full $C^1$ cubic spline space on a Powell-Sabin refined triangulation, for which a B-spline basis can be constructed. Blossoming is used to identify the $C^2$ smoothness conditions…
Splines are central objects for the interpolation of discrete data via piecewise smooth paths. Their iterated-integral signature is an infinite collection of tensors which characterizes paths almost uniquely. We study truncations of this…
A prescription for constructing dictionaries for cardinal spline spaces on a compact interval is provided. It is proved that such spaces can be spanned by dictionaries which are built by translating a prototype B-spline function of fixed…
The space of $C^1$ cubic Clough-Tocher splines is a classical finite element approximation space over triangulations for solving partial differential equations. However, for such a space there is no B-spline basis available, which is a…
Reasoning about distance is indispensable for establishing or avoiding contact in manipulation tasks. To this end, we present an online approach for learning implicit representations of signed distance using piecewise polynomial basis…
In this paper, we present a novel algorithm for piecewise linear regression which can learn continuous as well as discontinuous piecewise linear functions. The main idea is to repeatedly partition the data and learn a liner model in in each…
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 present paper provides a general formula for the dimension of spline space over T-meshes using smoothing cofactor-conformality method. And we introduce a new notion, Diagonalizable T-mesh, over which the dimension formula is only…
We discuss the direct use of cubic-matrix splines to obtain continuous approximations to the unique solution of matrix models of the type $Y''(x) = f(x,Y(x))$. For numerical illustration, an estimation of the approximation error, an…
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on a template, usually a set of relations, upon which they are…
This paper discusses the dimension of spline spaces with highest order smoothness over hierarchical T-meshes over certain type of hierarchical T-meshes. The major step is to set up a bijection between the spline space with highest order…
Multivariate piecewise polynomial functions (or splines) on polyhedral complexes have been extensively studied over the past decades and find applications in diverse areas of applied mathematics including numerical analysis, approximation…
A "blendstring" is a piecewise polynomial interpolant with high-degree two-point Hermite interpolational polynomials on each piece, analogous to a cubic spline. Blendstrings are smoother and can be more accurate than cubic splines, and can…
This paper presents a general framework for calculating the dimension of spline spaces over arbitrary rectilinear partitions using the smoothing cofactor method. The approach extends existing dimension theory for polynomial splines over…
For any 3-monotone on $[a,b]$ function $f$ (its third divided differences are nonnegative for all choices of four distinct points, or equivalently, $f$ has a convex derivative on $(a,b)$) we construct a cubic 3-monotone (like $f$) spline…
Existing methods for constructing splines and Bezier curves on a Lie group G involve repeated products of exponentials deduced from local geodesics, w.r.t. a Riemannian metric, or rely on general polynomials. Moreover, each of these local…
Given a graph whose edges are labeled by ideals of a commutative ring R with identity, a generalized spline is a vertex labeling by the elements of R such that the difference of the labels on adjacent vertices lies in the ideal associated…
The nine two-dimensional Cayley-Klein geometries are firstly reviewed by following a graded contraction approach. Each geometry is considered as a set of three symmetrical homogeneous spaces (of points and two kinds of lines), in such a…
We introduce a problem class we call Polynomial Constraint Satisfaction Problems, or PCSP. Where the usual CSPs from computer science and optimization have real-valued score functions, and partition functions from physics have monomials,…