4阶均匀代数三角样条空间的拟Legendre基

为解决代数三角样条空间上正交基的理论问题,提出了4阶均匀代数三角样条空间上构造正交基的方法.该方法利用6阶C-B样条基函数构造一组辅助函数,并以这组辅助函数的二阶导数形式定义样条空间上的一组正交基,称为拟Legendre基.实例结果表明,使用这组正交基可以简化内积计算,便于最佳平方逼近问题求解.     

A Bivariate Spline Method for Second Order Elliptic Equations in Non-divergence Form

A bivariate spline method is developed to numerically solve second order elliptic partial differential equations in non-divergence form. The existence, uniqueness, stability as well as approximation properties of the discretized solution will be established by using the well-known Ladyzhenskaya–Babuska–Brezzi condition. Bivariate splines, discontinuous splines with smoothness constraints are used to implement the method. Computational results based on splines of various degrees are presented to demonstrate the effectiveness and efficiency of our method.     

Allgemeine interpolierende Splines vom Grade 3

Choosing a special case of a general Hermitian interpolating operator, an interpolating spline is constructed with respect to the usual transient-conditions within the knots of the spline. The resulting spline in general is not a polynomial spline. The polynomial spline is contained as a special case as well as e. g. rational, trigonometrical, and exponential splines. A sufficient criterion for existence and uniqueness is given for general interpolating splines of third degree. A statement concerning convergence is added.     

一类四次有理样条的形状控制及其逼近性质

本文基于一类带控制参数包含极点的(4,2)~k(k=1,2)阶有理插值样条,研究了它的约束插值问题,给出了将该种插值曲线约束于给定折线、二次曲线之上、之下或之间的充分条件.并讨论了该插值的逼近性质,最后给出了数值例子.     

Contour reconstruction using recursive smoothing splines - Algorithms and experimental validation

In this paper, a recursive smoothing spline approach for contour reconstruction is studied and evaluated. Periodic smoothing splines are used by a robot to approximate the contour of encountered obstacles in the environment. The splines are generated through minimizing a cost function subject to constraints imposed by a linear control system and accuracy is improved iteratively using a recursive spline algorithm. The filtering effect of the smoothing splines allows for usage of noisy sensor data and the method is robust to odometry drift. The algorithm is extensively evaluated in simulations for various contours and in experiments using a SICK laser scanner mounted on a PowerBot from ActivMedia Robotics.     

Sextic spline collocation methods for nonlinear fifth-order boundary value problems

In this paper, two sextic-spline collocation methods are developed and analysed for approximating solutions of nonlinear fifth-order boundary-value problems. The first method uses a spline interpolant and the second one is based on a spline quasi-interpolant, which are constructed from sextic splines. They are both proved to be second-order convergent. Numerical results confirm the order of convergence predicted by the analysis. It has been observed that the methods developed in this paper are better than the others given in the literature.     

Retailoring Box Splines to Lattices for Highly Isotropic Volume Representations

3D box splines are defined by convolving a 1D box function with itself along different directions. In volume visualization, box splines are mainly used as reconstruction kernels that are easy to adapt to various sampling lattices, such as the Cartesian Cubic (CC), Body‐Centered Cubic (BCC), and Face‐Centered Cubic (FCC) lattices. The usual way of tailoring a box spline to a specific lattice is to span the box spline by exactly those principal directions that span the lattice itself. However, in this case, the preferred directions of the box spline and the lattice are the same, amplifying the anisotropic effects of each other. This leads to an anisotropic volume representation with strongly preferred directions. Therefore, in this paper, we retailor box splines to lattices such that the sets of vectors that span the box spline and the lattice are disjoint sets. As the preferred directions of the box spline and the lattice compensate each other, a more isotropic volume representation can be achieved. We demonstrate this by comparing different combinations of box splines and lattices concerning their anisotropic behavior in tomographic reconstruction and volume visualization.     

Optimal Spline Approximation via ℓ0‐Minimization

Splines are part of the standard toolbox for the approximation of functions and curves in ?^d. Still, the problem of finding the spline that best approximates an input function or curve is ill‐posed, since in general this yields a “spline” with an infinite number of segments. The problem can be regularized by adding a penalty term for the number of spline segments. We show how this idea can be formulated as an ?₀‐regularized quadratic problem. This gives us a notion of optimal approximating splines that depend on one parameter, which weights the approximation error against the number of segments. We detail this concept for different types of splines including B‐splines and composite Bézier curves. Based on the latest development in the field of sparse approximation, we devise a solver for the resulting minimization problems and show applications to spline approximation of planar and space curves and to spline conversion of motion capture data.     

Calculating with box splines

Box splines are multivariate splines over regular grids. Two recursion formulas for box splines are developed: (1) a Mansfield-de Boor-like expression of box splines as linear combinations of box splines of lower degree and (2) a deBoor-like reduction of the net of box spline control points. The ideas follow those from the paper by deBoor in 1972. The proofs are geometrical and simple.     

Local control of interval tension using weighted splines

Cubic spline interpolation and B-spline sums are useful and powerful tools in computer aided design. These are extended by weighted cubic splines which have tension controls that allow the user to tighten or loosen the curve on intervals between interpolation points. The weighted spline is a C¹ piecewise cubic that minimizes a variational problem similar to one that a C² cubic spline minimizes. A B-spline like basis is constructed for weighted splines where each basis function is nonnegative and nonzero only on four intervals. The basis functions sum up identically to one, thus curves generated by summing control points multiplied by the basis functions have the convex hull property. Different weights are built into the basis functions so that the control point curves are piecewise cubics with local control of interval tension. If all weights are equal, then the weighted spline is the C² cubic spline and the basis functions are B-splines.     

Feature-based spline optimization in CAD

In this paper, an advanced method for CAD-based spline structure optimization is investigated. The method is based on the combination of the commonly known parameter-based spline shape optimization and a recently presented feature-based structure variation concept for commercial CAD tools. The aim is to extend common parameter-based spline shape variation by the additional possibility to automatically add and remove control points or entire splines directly in CAD space. Such advanced spline modification provides a new level of flexibility in general geometry-based structural optimization. Using these splines to build CAD models, entirely new structures may be automatically generated during an optimization run through this newly gained flexibility in spline manipulation. The idea is to roughly define a continuous design space by basic splines and to gradually increase their shape complexity by control point number variation during optimization. Thus, operating on a knowledge-lean initialization—a design space bounded by basic splines and filled with material—this combination further extends the search and solution spaces of CAD-based structural optimization. The paper provides an outlook towards automated geometry-based structure creation combining nowadays commercial CAD software and a dedicated variation and optimization framework for geometry-based structural optimization.     

Interchanging spline curves using IGES

Current CAD/CAM systems employ a variety of spline types, spline representations, and curve design algorithms. The IGES (initial graphic exchange specification) was designed to enable interchange of the more commonly used spline types among CAD/CAM systems, independent of the design algorithms originally used to create them. IGES supports parametric cubic splines through a piecewise polynomial representation. This paper describes the design considerations leading to the interchange common spline curve types. A short introduction to splines and spline representations is included.     

Konvergenz von quadratischen Interpolations- und Flächenabgleichssplines

The purpose of this paper is to show that for continuous functions the related quadratic splines converge without any assumption on the spline grid. The points of the interpolatory grid can be chosen between the corresponding points of the spline grid with a division ratio from \(\frac{{\sqrt 2 }}{2}\) to \(1 - \frac{{\sqrt 2 }}{2}\) . In the case of continuously differentiable functions the division ratio can even be taken between 0 and 1; in addition, the order of convergence is increased. For twice differentiable functions the full order of convergence is obtained. Analogous results about the convergence of histo splines are proved.     

图像插值的多结点样条技术

为了获得质量更好的插值图像,提出了用具有紧支集的多结点样条基函数来进行图像插值的新技术,并首先将1维的多结点样条插值算法推广到2维,建立了用于图像数据的插值公式;然后分析了多结点样条插值方法的逼近精度、正则性、插值核函数的频域特性.对逼近精度、正则性、插值核函数频域特性的比较表明,该插值方法优于传统的三次卷积插值方法,实验结果也证实了用多结点样条插值算法重建的图像具有更高的质量.     

Manifold splines with a single extraordinary point

This paper develops a novel computational technique to define and construct manifold splines with only one singular point by employing the rigorous mathematical theory of Ricci flow. The central idea and new computational paradigm of manifold splines are to systematically extend the algorithmic pipeline of spline surface construction from any planar domain to an arbitrary topology. As a result, manifold splines can unify planar spline representations as their special cases. Despite its earlier success, the existing manifold spline framework is plagued by the topology-dependent, large number of singular points (i.e., |2g−2| for any genus-g surface), where the analysis of surface behaviors such as continuity remains extremely difficult. The unique theoretical contribution of this paper is that we devise new mathematical tools so that manifold splines can now be constructed with only one singular point, reaching their theoretic lower bound of singularity for real-world applications. Our new algorithm is founded upon the concept of discrete Ricci flow and associated techniques. First, Ricci flow is employed to compute a special metric of any manifold domain (serving as a parametric domain for manifold splines), such that the metric becomes flat everywhere except at one point. Then, the metric naturally induces an affine atlas covering the entire manifold except this singular point. Finally, manifold splines are defined over this affine atlas. The Ricci flow method is theoretically sound, and practically simple and efficient. We conduct various shape experiments and our new theoretical and algorithmic results alleviate the modeling difficulty of manifold splines, and hence, promote the widespread use of manifold splines in surface and solid modeling, geometric design, and reverse engineering.     

A class of general quartic spline curves with shape parameters

With a support on four consecutive subintervals, a class of general quartic splines are presented for a non-uniform knot vector. The splines have C² continuity at simple knots and include the cubic non-uniform B-spline as a special case. Based on the given splines, piecewise quartic spline curves with three local shape parameters are given. The given spline curves can be C²∩G³ continuous by fixing some values of the curve?s parameters. Without solving a linear system, the spline curves can also be used to interpolate sets of points with C² continuity. The effects of varying the three shape parameters on the shape of the quartic spline curves are determined and illustrated.     

The L2-polynomial spline pyramid

The authors are concerned with the derivation of general methods for the L₂ approximation of signals by polynomial splines. The main result is that the expansion coefficients of the approximation are obtained by linear filtering and sampling. The authors apply those results to construct a L₂ polynomial spline pyramid that is a parametric multiresolution representation of a signal. This hierarchical data structure is generated by repeated application of a REDUCE function (prefilter and down-sampler). A complementary EXPAND function (up-sampler and post-filter) allows a finer resolution mapping of any coarser level of the pyramid. Four equivalent representations of this pyramid are considered, and the corresponding REDUCE and EXPAND filters are determined explicitly for polynomial splines of any order n (odd). Some image processing examples are presented. It is demonstrated that the performance of the Laplacian pyramid can be improved significantly by using a modified EXPAND function associated with the dual representation of a cubic spline pyramid     

三次样条构造的伪逆解法

为了提高三次样条构造的可行性, 基于矩阵的伪逆方法, 提出一种不依赖额外约束条件的三次样条构造的伪逆解法。该解法通过求解出三次样条二阶导数的最小范数解, 从而较好地构造出三次样条函数。理论分析及数值实验结果表明该三次样条构造的伪逆解法具有简单、有效等特点。综合分析各种构造解法的性质, 对各种三次样条构造解法进行归类比较, 为在实际工程计算应用中选择合适的三次样条构造解法提供了指导方向。     

A new family of convex splines for data interpolation

This paper develops a new family of convexity-preserving splines of order n, hereby entitled the CPn-spline, that preserves convexity when derivatives at the data points satisfy some reasonable conditions. The spline comprises four components: a constant term, a first order term, and two nth order binomials. A slope-averaging-method is proposed for the general implementation of the new spline. Numerical results that allow for an assessment of the new spline are provided. In particular, a comparative analysis of the CPn-spline, the cubic spline, and of the Carnicer '92 spline is performed. By varying two parameters, the spline shape can be controlled at the local level, while other conventional means can be used to control the shape at the global level. The CPn-spline has no singularities in the case where inflection points are present. Additionally, a less general form of the CPn-spline that applies to most practical cases can be implemented with extreme ease.     

A class of template splines

A common frame of template splines that unifies the definitions of various spline families, such as smoothing, regression or penalized splines, is considered. The nonlinear nonparametric regression problem that defines the template splines can be reduced, for a large class of Hilbert spaces, to a parameterized regularized linear least squares problem, which leads to an important computational advantage. Particular applications of template splines include the commonly used types of splines, as well as other atypical formulations. In particular, this extension allows an easy incorporation of additional constraints, which is generally not possible in the context of classical spline families.