Planar curve interpolation by piecewise conics of arbitrary type

Five points in general position inR ² always lie on a unique conic, and three points plus two tangents also have a unique interpolating conic, the type of which depends on the data. These well-known facts from projective geometry are generalized: an odd number 2n+1≥5 of points inR ², if they can be interpolated at all by a smooth curve with nonvanishing curvature, will have a uniqueGC ² interpolant consisting of pieces of conics of varying type. This interpolation process reproduces conics of arbitrary type and preserves strict convexity. Under weak additional assumptions its approximation order is ?(h ⁵), whereh is the maximal distance of adjacent data pointsf(t _i ) sampled from a smooth and regular planar curvef with nonvanishing curvature. Two algorithms for the construction of the interpolant are suggested, and some examples are presented.     

OnG 2 continuous cubic spline interpolation

In this paper the interpolation byG ² continuous planar cubic Bézier spline curves is studied. The interpolation is based upon the underlying curve points and the end tangent directions only, and could be viewed as an extension of the cubic spline interpolation to the curve case. Two boundary, and two interior points are interpolated per each spline section. It is shown that under certain conditions the interpolation problem is asymptotically solvable, and for a smooth curvef the optimal approximation order is achieved. The practical experiments demonstrate the interpolation to be very satisfactory. Supported in prat by the Ministry of Science and Technology of Slovenjia, and in part by the NSF and SF of National Educational Committee of China.     

Interpolation regions for convex cubic curve segments

Given a family of planar, convex, cubic curve segments with fixed end points and tangents, subregions of the plane are characterized in which additional points can be interpolated by at least one member of the family. The region for a second additional point is a remarkably thin double crescent.     

Curvature variation minimizing cubic Hermite interpolants

In this paper, planar parametric Hermite cubic interpolants with small curvature variation are studied. By minimization of an appropriate approximate functional, it is shown that a unique solution of the interpolation problem exists, and has a nice geometric interpretation. The best solution of such a problem is a quadratic geometric interpolant. The optimal approximation order 4 of the solution is confirmed. The approach is combined with strain energy minimization in order to obtain G¹ cubic interpolatory spline.     

Lattice Points in Planar Convex Domains

We investigate the number of lattice points in planar convex domains. We give estimates of the remainder in the asymptotic representation with numerical constants, which are astonishingly small. We consider convex planar domains whose boundary has nonvanishing curvature throughout. Here the curvature of the curve of boundary plays an important role. Further, we consider the number of lattice points in domains which are bounded by superellipses. These curves have isolated points with curvature zero.     

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

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

经过三点的平面参数三次曲线的生成方法

本文提出一种经过三点另加一控制点的生成平面参数三次曲线的方法，它兼顾插值与逼近两方面的需要，具有明显的直观几何解释，并能按照不同的要求灵活地选择参变量的值和控制点的位置以调整和控制曲线的形状。     

导数振荡与应变能极小的平面分段三次参数Hermite插值

由于分段三次参数Hermite插值的切矢往往被作为变量,故可对其进行优化以使得构造的插值曲线满足特定的要求.为了构造兼具保形性与光顺性的平面分段三次参数Hermite插值曲线,给出了一种通过同时极小化导数振荡和应变能来确定切矢的方法.首先以导数振荡函数和应变能函数为双目标建立了切矢满足的方程系统;然后证明了方程系统存在唯一解,并给出了解的具体表达式;最后给出了误差分析,并通过数值算例表明方法的有效性.结果表明,相对于导数振荡极小化方法和应变能极小化方法,所提出的导数振荡和应变能极小化方法同时兼顾了平面分段三次参数Hermite插值曲线的保形性和光顺性.     

曲率变化率最小约束下的五次Hermite插值曲线

本文提出了在曲率变化率最小约束条件下的五次Hermite插值曲线算法,与传统的Hermite插值曲线算法相比,利用该算法获得的插值曲线具有更均匀的曲率分布,曲线更光顺,质量更好。     

Approximation of a planar cubic Bézier spiral by circular arcs

A planar cubic Bézier curve that is a spiral, i.e., its curvature varies monotonically, does not have internal cusps, loops, and inflection points. It is suitable as a design tool for applications in which fair curves are important. Since it is polynomial, it can be conveniently incorporated in CAD systems that are based on B-splines, Bézier curves, or NURBS. When machining objects, it is desirable that as much as possible of a curved toolpath be approximated by a sequence of circular arcs rather than straight-line segments. Such an arc-spline approximation of a planar cubic Bézier spiral is presented.     

A planar cubic Bézier spiral

A planar cubic Bézier curve segment that is a spiral, i.e., its curvature varies monotonically with arc-length, is discussed. Since this curve segment does not have cusps, loops, and inflection points (except for a single inflection point at its beginning), it is suitable for applications such as highway design, in which the clothoid has been traditionally used. Since it is polynomial, it can be conveniently incorporated in CAD systems that are based on B-splines, Bézier curves, or NURBS (nonuniform rational B-splines) and is thus suitable for general curve design applications in which fair curves are important.     

On Shape Preserving C2 Hermite Interpolation

We propose a general parametric local approach for functional C ² Hermite shape preserving interpolation. The constructed interpolant is a parametric curve which interpolate values, first and second derivatives of a given function and reproduces the behavior of the data. The method is detailed for parametric curves with piecewise cubic components. For the selected space necessary and sufficient conditions are derived to ensure the convexity of the constructed interpolant. Monotonicity is also studied. The approximation order is investigated for both cases. The use of a parametric curves to interpolate data from a function can be considered a disadvantage of the scheme. However, the simple structure of the used curve greatly reduces such a disadvantage.     

平面C-B样条的奇拐点分析

平面C-B样条曲线是三次均匀B样条的推广.通过移动C-B样条曲线段的一个控制点而固定其余三个控制点的方法,讨论了在曲线上形成零曲率点的移动控制点的轨迹,得到了C-B样条曲线段的尖点判别曲线、拐点判别区域,同时也给出了在曲线段上生成重结点的移动控制点的轨迹区域.     

利用近似能量极小构造平面C1三次Hermite插值曲线

研究了利用近似能量极小构造平面$C^1$三次Hermite插值曲线的方法.该方法的主要的目是求出$C^1$三次Hermite插值曲线的最佳切矢.通过将应变能、曲率变化能和组合能的近似函数极小化,得到了求解最佳切矢的线性方程组.通过求解发现,近似曲率变化能极小不存在唯一解, 而近似应变能极小和近似组合能极小由于方程系统的系数矩阵为严格对角占优故都存在唯一解.最后, 通过实例表明了本文方法构造平面$C^1$三次Hermite插值曲线的有效性.     

G2 composite cubic Bézier curves

We present an algorithm for creating planar G² spline curves using rational Bézier cubic segments. The splines interpolate a sequence of points, tangents and curvatures. In addition each segment has two more geometric shape handles. These are obtained from an analysis of the singular point of the curve. The individual segments are convex, but zero curvature can be assigned at a junction point, hence inflection points can be placed where desired but cannot occur otherwise.     

On G 2 Continuous Spline Interpolation of Curves in ℝ d

In this paper the problem of G ² continuous interpolation of curves in ^d by polynomial splines of degree n is studied. The interpolation of the data points and two tangent directions at the boundary is considered. The case n = r + 2 = d, where r is the number of interior points interpolated by each segment of the spline curve, is studied in detail. It is shown that the problem is uniquely solvable asymptotically, e., when the data points are sampled regularly and sufficiently dense, and lie on a regular, convex parametric curve in ^d . In this case the optimal approximation order is also determined.     

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)     

Short Communication: Curvature Approximation in Images

We consider discrete planar curves as they appear in segmented images. In the literature, the curvature of such curves is often estimated via B-spline approximations or by interpolation schemes, while to the best of our knowledge current methods lack of a proof of convergence, see [2, 3]. We will not only proof the convergence of our method in the uniform norm for smooth curves, we will also show that our method is able to detect critical points (C²-singularities) of our given discrete data, i.e., points where the curvature is undefined. The main idea is to approximate the curve such that the shape of the curve is preserved. Here, we use the Schoenberg splines because of the freedom to choose the knots arbitrarily and because of their variation-diminishing property that leads to an approximation which preserves positivity, monotonicity and convexity. (© 2014 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

A weighted curvature flow for shape deformation

In this paper we shall discuss a weighted curvature flow for a regular curve in the 2D Euclidean space. The weighted curvature flow for planar curves is a generalization of the well-known curvature flow discussed by Gage, Hamilton and Grayson. Under a suitable weighted curvature flow, convex curves will remain convex in the deformation process. However, the curve may not converge to a round point for general weights. Indeed, for a nonnegative weight function ω(u) with k isolated zeros, a curve will converge to a limiting k-polygon. The weighted curvature flow will have many useful properties which have applications to image processing. We shall also present some numerical simulations to illustrate how curves deform under the weighted curvature flow with different weight functions ω(u). Moreover, our algorithm is very effective and stable. The approximation of higher derivatives in our new algorithm only involve in the neighboring points.     

CAN A CUBIC SPLINE CURVE BE G3

This paper proposes a method to construct an G³cubic spline curve from any given open control polygon.For any two inner Bezier points on each edge of a control polygon,we can de ne each Bezier junction point such that the spline curve is G2-continuous.Then by suitably choosing the inner Bezier points,we can construct a global G³spline curve.The curvature combs and curvature plots show the advantage of the G³cubic spline curve in contrast with the traditional C2 cubic spline curve.