Related papers: A New Algorithm for the Evaluation of Generalized …
Approximating complex curves with simple parametric curves is widely used in CAGD, CG, and CNC. This paper presents an algorithm to compute a certified approximation to a given parametric space curve with cubic B-spline curves. By…
Trigonometric and hyperbolic B-splines can be computed via recurrence relations analogous to the classical polynomial B-splines. However, in their original formulation, these two types of B-splines do not form a partition of unity and…
A fast algorithm for B-splines in mixed models is presented. B-splines have local support and are computational attractive, because the corresponding matrices are sparse. A key element of the new algorithm is that the local character of…
This paper presents a new method for modelling periodic signals having an aperiodic trend, using the method of variable projection. It is a major extension to the IEEE-standard 1057 by permitting the background to be time varying;…
Classical splines feature prominently in approximation theory and numerical analysis, while GKM theory arises in the study of equivariant cohomology. More recently, generalized splines have been studied which simultaneously generalize both…
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.…
We present a procedure to approximate a plane contour by piecewise polynomial functions, depending on various parameters, such as degree, number of local patches, selection of knots. This procedure aims to be adopted to study how…
We present Spline-based Convolutional Neural Networks (SplineCNNs), a variant of deep neural networks for irregular structured and geometric input, e.g., graphs or meshes. Our main contribution is a novel convolution operator based on…
Generalized splines are a simultaneous generalization of GKM theory -- which studies equivariant cohomology -- and classical splines, which provide piecewise approximations of functions. Generalized splines can also be understood via…
Local refinement is vital for efficient numerical simulations. In the context of Isogeometric Analysis (IGA), hierarchical B-splines have gained prominence. The work applies the methodology of truncated hierarchical B-splines (THB-splines)…
The graph structure of a Bayesian network (BN) can be learned from data using the well-known score-and-search approach. Previous work has shown that incorporating structured representations of the conditional probability distributions…
This work aims at the precise and efficient computation of the x-ray projection of an image represented by a linear combination of general shifted basis functions that typically overlap. We achieve this with a suitable adaptation of ray…
We consider a class of non-polynomial spline spaces over T-meshes, that is, of spaces locally spanned both by polynomial and by suitably-chosen non-polynomial functions, which we will refer to as generalized splines over T-meshes. For such…
We present weighted quadrature for hierarchical B-splines to address the fast formation of system matrices arising from adaptive isogeometric Galerkin methods with suitably graded hierarchical meshes. By exploiting a local tensor-product…
We introduce an efficient algorithmic procedure for implementing the direct formula that represents the product of splines in the B-spline basis. We first demonstrate the relevance of this direct approach through numerical evidence showing…
Tchebycheffian splines are smooth piecewise functions whose pieces are drawn from (possibly different) Tchebycheff spaces, a natural generalization of algebraic polynomial spaces. They enjoy most of the properties known in the polynomial…
In simulation technology, computationally expensive objective functions are often replaced by cheap surrogates, which can be obtained by interpolation. Full grid interpolation methods suffer from the so-called curse of dimensionality,…
Let $R$ be a commutative ring with identity and $G$ a graph. An extending generalized spline on $G$ is a vertex labeling $f \in \prod_{v} M_v$, where for each edge $e=uv$ there exists an $R$-module $M_{uv}$ together with homomorphisms $…
We propose a new algorithm for curve skeleton computation which differs from previous algorithms by being based on the notion of local separators. The main benefits of this approach are that it is able to capture relatively fine details and…
In the framework of a recently reported linear-scaling method for density-functional-pseudopotential calculations, we investigate the use of localized basis functions for such work. We propose a basis set in which each local orbital is…