Related papers: Dimension Calculation for Spline Spaces over Recti…
Generalizing tensor-product splines to smooth functions whose control nets outline topological polyhedra, bi-cubic polyhedral splines form a piecewise polynomial, first-order differentiable space that associates one function with each…
Multi-degree splines are smooth piecewise-polynomial functions where the pieces can have different degrees. We describe a simple algorithmic construction of a set of basis functions for the space of multi-degree splines, with similar…
We present a general method to obtain interesting subspaces of the $C^2$ cubic spline space defined on the cubic Wang-Shi refinement of a given arbitrary triangulation $\mathcal{T}$. These subspaces are characterized by specific Hermite…
We propose a method to efficiently compute tomographic projections of a 3D volume represented by a linear combination of shifted B-splines. To do so, we propose a ray-tracing algorithm that computes 3D line integrals with arbitrary…
Recently I proposed a new calculation scheme of a partition function of an immersion object using path integral method and theory of soliton (to appear in J.Phys.A). I applied the scheme to problem of elastica in two-dimensional space and…
A piecewise Chebyshevian spline space is good for design when it possesses a B-spline basis and this property is preserved under knot insertion. The interest in such kind of spaces is justified by the fact that, similarly as for polynomial…
The problem of monotone smoothing splines with bounds is formulated as a constrained minimization problem of the calculus of variations. Existence and uniqueness of solutions of this problem is proved, as well as the equivalence of it to a…
We develop a discrete extension operator for trimmed spline spaces consisting of piecewise polynomial functions of degree $p$ with $k$ continuous derivatives. The construction is based on polynomial extension from neighboring elements…
We study the module $C^r(\mathcal{P})$ of piecewise polynomial functions of smoothness $r$ on a pure $n$-dimensional polytopal complex $\mathcal{P}\subset\mathbb{R}^n$, via an analysis of certain subcomplexes $\mathcal{P}_W$ obtained from…
Construction of spline surfaces from given boundary curves is one of the classical problems in computer aided geometric design, which regains much attention in isogeometric analysis in recent years and is called domain parameterization.…
Traditional problems in computational geometry involve aspects that are both discrete and continuous. One such example is nearest-neighbor searching, where the input is discrete, but the result depends on distances, which vary continuously.…
We propose a multidimensional smoothing spline algorithm in the context of manifold learning. We generalize the bending energy penalty of thin-plate splines to a quadratic form on the Sobolev space of a flat manifold, based on the Frobenius…
General computational methods based on descriptor state-space realizations are proposed to compute coprime factorizations of rational matrices with minimum degree denominators. The new methods rely on recursive pole dislocation techniques,…
Geometrically continuous splines are piecewise polynomial functions defined on a collection of patches which are stitched together through transition maps. They are called $G^{r}$-splines if, after composition with the transition maps, they…
In this paper we present an efficient and robust approach to compute a normalized B-spline-like basis for spline spaces with pieces drawn from extended Tchebycheff spaces. The extended Tchebycheff spaces and their dimensions are allowed to…
We present a method to compute a fitting curve B to a set of data points d0,...,dm lying on a manifold M. That curve is obtained by blending together Euclidean B\'ezier curves obtained on different tangent spaces. The method guarantees…
This paper proposes an original Riemmanian geometry for low-rank structured elliptical models, i.e., when samples are elliptically distributed with a covariance matrix that has a low-rank plus identity structure. The considered geometry is…
We propose a collocation method based on multivariate polynomial splines over triangulation or tetrahedralization for the numerical solution of partial differential equations. We start with a detailed explanation of the method for the…
In a previous paper it was shown that a machine learning regression problem can be solved within the framework of random function theory, with the optimal kernel analytically derived from symmetry and indifference principles and coinciding…
Spline functions are smooth piecewise polynomials widely used for interpolation and smoothing, and nonnegative spline smoothing is also studied for nonnegative data. Previous research used sufficient conditions for the nonnegativity of…