Reconstruction of the Linear Ordinary Differential System Based on Discrete Points

In this paper, we discuss an inverse problem, i.e., the reconstruction of a linear differential dynamic system from the given discrete data of the solution. We propose a model and a corresponding algorithm to recover the coefficient matrix of the differential system based on the normal vectors from the given discrete points, in order to avoid the problem of parameterization in curve fitting and approximation. We also give some theoretical analysis on our algorithm. When the data points are taken from the solution curve and the set composed of these data points is not degenerate, the coefficient matrix $A$ reconstructed by our algorithm is unique from the given discrete and noisefree data. We discuss the error bounds for the approximate coefficient matrix and the solution which are reconstructed by our algorithm. Numerical examples demonstrate the effectiveness of the algorithm.     

球面上的几何连续插值

In this paper, a new method for geometrically continuous interpolation in spheres is proposed. The method is entirely based on the spherical B′ezier curves defined by the generalized de Casteljau algorithm. Firstly we compute the tangent directions and curvature vectors at the endpoints of a spherical B′ezier curve. Then, based on the above results, we design a piecewise spherical B′ezier curve with G 1 and G 2 continuity. In order to get the optimal piecewise curve according to two different criteria, we also give a constructive method to determine the shape parameters of the curve. According to the method, any given spherical points can be directly interpolated in the sphere. Experimental results also demonstrate that the method performs well both in uniform speed and magnitude of covariant acceleration.     

Approximate merging of B-spline curves and surfaces

Applying the distance function between two B-spline curves with respect to the L2 norm as the approximate error, we investigate the problem of approximate merging of two adjacent B-spline curves into one B-spline curve. Then this method can be easily extended to the approximate merging problem of multiple B-spline curves and of two adjacent surfaces. After minimizing the approximate error between curves or surfaces, the approximate merging problem can be transformed into equations solving. We express both the new control points and the precise error of approximation explicitly in matrix form. Based on homogeneous coordinates and quadratic programming, we also introduce a new framework for approximate merging of two adjacent NURBS curves. Finally, several numerical examples demonstrate the effectiveness and validity of the algorithm.     

Offset approximation based on reparameterizing the path of a moving point along the base circle

This paper presents a novel algorithm for planar curve offsetting. The basic idea is to regard the locus relative to initial base circle, which is formed by moving the unit normal vectors of the base curve, as a unit circular arc first, then accurately to represent it as a rational curve, and finally to reparameterize it in a particular way to approximate the offset. Examples illustrated that the algorithm yields fewer curve segments and control points as well as C^1 continuity, and so has much significance in terms of saving computing time, reducing the data storage and smoothing curves entirely.     

Geometric meanings of the parameters on rational conic segments

Using algebraic and geometric methods,functional relationships between a point on a conic segment and its corresponding parameter are derived when the conic segment is presented by a rational quadratic or cubic Bézier curve.That is,the inverse mappings of the mappings represented by the expressions of rational conic segments are given.These formulae relate some triangular areas or some angles,determined by the selected point on the curve and the control points of the curve,as well as by the weights of the rational Bézier curve.Also,the relationship can be expressed by the corresponding parametric angles of the selected point and two endpoints on the conic segment,as well as by the weights of the rational Bézier curve.These results are greatly useful for optimal parametrization,reparametrization,etc.,of rational Bézier curves and surfaces.     

BATE curve in assessment of clinical utility of predictive biomarkers

In this paper,for time-to-event data,we propose a new statistical framework for casual inference in evaluating clinical utility of predictive biomarkers and in selecting an optimal treatment for a particular patient.This new casual framework is based on a new concept,called Biomarker Adjusted Treatment Effect (BATE) curve.The BATE curve can be used for assessing clinical utility of a predictive biomarker,for designing a subsequent confirmation trial,and for guiding clinical practice.We then propose semi-parametric methods for estimating the BATE curves of biomarkers and establish asymptotic results of the proposed estimators for the BATE curves.We also conduct extensive simulation studies to evaluate finite-sample properties of the proposed estimation methods.Finally,we illustrate the application of the proposed method in a real-world data set.     

Cyclotomic problem, Gauss sums and Legendre curve

In this paper, explicit determination of the cyclotomic numbers of order l and 2l, for odd prime l ≡ 3 (mod 4), over finite field Fq in the index 2 case are obtained, utilizing the explicit formulas on the corresponding Gauss sums. The main results in this paper are related with the number of rational points of certain elliptic curve, called "Legendre curve", and the properties and value distribution of such number are also presented.     

Kernel estimators of the ROC Curve with censored data

Receiver operating characteristic (ROC) curves are often used to study the two sample problem in medical studies. However, most data in medical studies are censored. Usually a natural estimator is based on the Kaplan-Meier estimator. In this paper we propose a smoothed estimator based on kernel techniques for the ROC curve with censored data. The large sample properties of the smoothed estimator are established. Moreover, deficiency is considered in order to compare the proposed smoothed estimator of the ROC curve with the empirical one based on Kaplan-Meier estimator. It is shown that the smoothed estimator outperforms the direct empirical estimator based on the Kaplan-Meier estimator under the criterion of deficiency. A simulation study is also conducted and a real data is analyzed.     

截断分层B样条基的Lp稳定性

The truncated hierarchical B-spline basis has been proposed for adaptive data fitting and has already drawn a lot of attention in theory and applications.However the stability with respect to the L_p-norm,1≤p∞,is not clear.In this paper,we consider the L_p stability of the truncated hierarchical B-spline basis,since the L_p stability is useful for curve and surface fitting,especially for least squares fitting.We prove that this basis is weakly L_p stable.This means that the associated constants to be considered in the stability analysis are at most of polynomial growth in the number of the hierarchy depth.     

曲线造型设计的加密细分算法及其性质

In the application of CAD/CAM. the target form of a curve, which is used for plotting or as the data supplied for CAM, is s set of points on (or near by) the curve,Using the subdivision algorithm, the procedure of curve generation from Control points→Mathematical form of the curve→Points on(or near by) the curve which is used in most systems for curve design, is simplified in this paper to Control points→Points on(or near by) the curve. We also discuss the conditions of shape preserving, polynomial reproducing, continuity as well as the convergent properties of the target curve.     

基于轮廓关键点的B样条曲线拟合算法

针对逆向工程中的点云切片轮廓数据点列,提出一种基于轮廓关键点的B样条曲线拟合算法.在确保扫描线点列形状保真度的前提下,首先对其进行等距重采样等预处理,并遴选出曲线轮廓关键点,生成初始插值曲线;再利用邻域点比较法求出初始曲线与各采样点间的偏差值,在超过拟合允差处增加新的关键点,并生成新的插值曲线,重复该步骤至拟合曲线满足预定精度要求.实验表明,在对稠密的二维断面数据点进行B样条逼近时,该算法能有效压缩控制顶点数目,并具有较高的计算效率.同时,由于所得控制顶点的分布能准确反映曲线的曲率变化,该方法还可作为误差约束的曲线逼近中的迭代步骤之一.     

B-spline curve fitting with invasive weed optimization

B-spline curves and surfaces are generally used in computer aided design (CAD), data visualization, virtual reality, surface modeling and many other fields. Especially, data fitting with B-splines is a challenging problem in reverse engineering. In addition to this, B-splines are the most preferred approximating curve because they are very flexible and have powerful mathematical properties and, can represent a large variety of shapes efficiently [1]. The selection of the knots in B-spline approximation has an important and considerable effect on the behavior of the final approximation. Recently, in literature, there has been a considerable attention paid to employing algorithms inspired by natural processes or events to solve optimization problems such as genetic algorithms, simulated annealing, ant colony optimization and particle swarm optimization. Invasive weed optimization (IWO) is a novel optimization method inspired from ecological events and is a phenomenon used in agriculture. In this paper, optimal knots are selected for B-spline curve fitting through invasive weed optimization method. Test functions which are selected from the literature are used to measure performance. Results are compared with other approaches used in B-spline curve fitting such as Lasso, particle swarm optimization, the improved clustering algorithm, genetic algorithms and artificial immune system. The experimental results illustrate that results from IWO are generally better than results from other methods.     

Curve fitting with a Sobolev gradient method

Consider the problem of constructing a mathematical representation of a curve that satisfies constraints such as interpolation of specified points. This problem arises frequently in the context of both data fitting and Computer Aided Design. We treat the most general problem: the curve may or may not be constrained to lie in a plane; the constraints may involve specified points, tangent vectors, normal vectors, and/or curvature vectors, periodicity, or nonlinear inequalities representing shapepreservation criteria. Rather than the usual piecewise parametric polynomial (B-spline) or rational (NURB) formulation, we represent the curve by a discrete sequence of vertices along with first, second, and third derivative vectors at each vertex, where derivatives are with respect to arc length. This provides third-order geometric continuity and maximizes flexibility with an arbitrarily large number of degrees of freedom. The free parameters are chosen to minimize a fairness measure defined as a weighted sum of curve length, total curvature, and variation of curvature. We thus obtain a very challenging constrained optimization problem for which standard methods are ineffective. A Sobolev gradient method, however, is particularly effective. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Bounds on partial derivatives of NURBS surfaces

In this paper, we estimate the partial derivative bounds for Non-Uniform Rational B-spline(NURBS) surfaces. Firstly, based on the formula of translating the product into sum of B-spline functions, discrete B-spline theory and Dir function, some derivative bounds on NURBS curves are provided. Then, the derivative bounds on the magnitudes of NURBS surfaces are proposed by regarding a rational surface as the locus of a rational curve. Finally, some numerical examples are provided to elucidate how tight the bounds are.     

Knot Placement for B-Spline Curve Approximation via $L_{∞, 1}$-Norm and Differential Evolution Algorithm

In this paper, we consider the knot placement problem in B-spline curve approximation. A novel two-stage framework is proposed for addressing this problem. In the first step, the $l_{\infty, 1}$-norm model is introduced for the sparse selection of candidate knots from an initial knot vector. By this step, the knot number is determined. In the second step, knot positions are formulated into a nonlinear optimization problem and optimized by a global optimization algorithm — the differential evolution algorithm (DE). The candidate knots selected in the first step are served for initial values of the DE algorithm. Since the candidate knots provide a good guess of knot positions, the DE algorithm can quickly converge. One advantage of the proposed algorithm is that the knot number and knot positions are determined automatically. Compared with the current existing algorithms, the proposed algorithm finds approximations with smaller fitting error when the knot number is fixed in advance. Furthermore, the proposed algorithm is robust to noisy data and can handle with few data points. We illustrate with some examples and applications.     

一类C^3—连续的B—型样条曲线及其插值与逼近性

本文提出一类Ｃ３－连续的带有因子的Ｂ－型参数样条曲线,它的每一段只要四个 控制点就能生成,可用它直接插值或逼近于任意控制点或对控制边多边形作局部或整体逼 近。利用因子间的某些关系可将其次数降到最低．与普通的四次Ｂ－样条曲线相比,这类 曲线更加方便灵活。     

Arc Length Estimation and the Convergence of Polynomial Curve Interpolation

When fitting parametric polynomial curves to sequences of points or derivatives we have to choose suitable parameter values at the interpolation points. This paper investigates the effect of the parameterization on the approximation order of the interpolation. We show that chord length parameter values yield full approximation order when the polynomial degree is at most three. We obtain full approximation order for arbitrary degree by developing an algorithm which generates more and more accurate approximations to arc length: the lengths of the segments of an interpolant of one degree provide parameter intervals for interpolants of degree two higher. The algorithm can also be used to estimate the length of a curve and its arc-length derivatives. AMS subject classification (2000) 65D05, 65D10     

Bézier曲线和B样条曲线光顺拟合法

§1.引言 在计算机辅助几何设计(CAGD)工作中,适用于曲线造型的方法主要有样条函数、Bezier曲线和B样条曲线等。在实际工作中,几何外形设计又大致可以分成两类: (1)从头设计。按照给定的几个原始设计参数,决定曲线的特征多边形顶点,继而决定曲面的特征网格。在[1],[2]中所作的叶片和船体曲面造型,就是一种从头设计方案。 (2)模型设计。例如,传统的汽车车身设计,首先由美工师塑造一只车身的油泥模