Related papers: Area-Preserving Geometric Hermite Interpolation

We show that the sparse polynomial interpolation problem reduces to a discrete super-resolution problem on the $n$-dimensional torus. Therefore the semidefinite programming approach initiated by Cand\`es \\& Fernandez-Granda…

Edge-preserving smoothing is a fundamental procedure for many computer vision and graphic applications. This can be achieved with either local methods or global methods. In most cases, global methods can yield superior performance over…

Due to properties such as interpolation, smoothness, and spline connections, Hermite subdivision schemes employ fast iterative algorithms for geometrically modeling curves/surfaces in CAGD and for building Hermite wavelets in numerical…

We determine the pointwise error in Hermite interpolation by numerically solving an appropriate differential equation, derived from the error term itself. We use this knowledge to approximate the error term by means of a polynomial, which…

The method of constructing trigonometric Hermite splines, which interpolate the values of some periodic function and its derivatives in the nodes of a uniform grid, is considered. The proposed method is based on the periodicity properties…

We introduce the notion of quadratic hull of a linear code, and give some of its properties. We then show that any symmetric bilinear multiplication algorithm for a finite-dimensional algebra over a field can be obtained by…

Hermite methods, as introduced by Goodrich et al., combine Hermite interpolation and staggered (dual) grids to produce stable high order accurate schemes for the solution of hyperbolic PDEs. We introduce three variations of this Hermite…

Solving initial value problems and boundary value problems of Linear Ordinary Differential Equations (ODEs) plays an important role in many applications. There are various numerical methods and solvers to obtain approximate solutions…

In this work, we introduce the Kaiser-Bessel interpolation basis for the particle-mesh interpolation in the fast Ewald method. A reliable a priori error estimate is developed to measure the accuracy of the force computation in correlated…

We develop a unifying framework for interpolatory $\mathcal{L}_2$-optimal reduced-order modeling for a wide classes of problems ranging from stationary models to parametric dynamical systems. We first show that the framework naturally…

Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics, which is for example relevant for tasks like shape interpolation, pose transfer, or texture transfer. An often neglected but essential property…

Range functions are a fundamental tool for certified computations in geometric modeling, computer graphics, and robotics, but traditional range functions have only quadratic convergence order ($m=2$). For ``superior'' convergence order…

This study introduces a modular framework for spatial image processing, integrating grayscale quantization, color and brightness enhancement, image sharpening, bidirectional transformation pipelines, and geometric feature extraction. A…

This paper introduces a novel approach to approximating continuous functions over high-dimensional hypercubes by integrating matrix CUR decomposition with hyperinterpolation techniques. Traditional Fourier-based hyperinterpolation methods…

The implementation of discontinuous functions occurs in many of today's state-of-the-art partial differential equation solvers. However, in finite element methods, this poses an inherent difficulty: efficient quadrature rules available when…

In this paper, we intend to use a B-spline quasi-interpolation (BSQI) technique to develop higher order hybrid schemes for conservation laws. As a first step, we develop cubic and quintic B-spline quasi-interpolation based numerical methods…

In order to construct a $C^1$-quadratic spline over an arbitrary triangulation, one can split each triangle into 12 subtriangles, resulting in a finer triangulation known as the Powell-Sabin 12-split. It has been shown previously that the…

In this paper, a polynomial-time algorithm is given to compute the generalized Hermite normal form for a matrix F over Z[x], or equivalently, the reduced Groebner basis of the Z[x]-module generated by the column vectors of F. The algorithm…

Consider a rational family of planar rational curves in a certain region of interest. We are interested in finding an approximation to the implicit representation of the envelope. Since exact implicitization methods tend to be very costly,…

Geometric embeddings have recently received attention for their natural ability to represent transitive asymmetric relations via containment. Box embeddings, where objects are represented by n-dimensional hyperrectangles, are a particularly…