满足数据点切向约束的二次B样条插值曲线

给出一种二次B样条曲线插值方法.利用数据点的参数化和节点向量的自由度,构造在各数据点满足切向约束的二次B样条插值曲线,直观地控制插值曲线达到预期形状.用文中方法构造插值曲线是一个递推过程,不必预先确定数据点参数值和节点向量、不必解线性方程组,而是在插值过程中根据数据点及其切向的约束条件递推地确定数据点的参数值、节点和控制顶点.该文方法允许插值曲线各段的连接点与数据点不一致,以使得二次B样条插值曲线的形状更自然.而且在满足数据点切向约束的条件下,还可利用节点进一步调控插值曲线的形状.另外,用文中方法构造的二次B样条插值曲线对于数据点的改变具有较好的局部性质.文中最后给出一些例子将该文方法与其它一些插值方法进行比较,实验结果表明,该文方法是有效的.     

开圆弧样条的保形插值算法

提出一种G1圆弧样条插值算法.该算法选取部分满足条件的型值点构造初始圆,然后过剩下的型值点分别构造相邻初始圆的公切圆.在此过程中,让所有型值点均为相应圆弧的内点,且每段圆弧尽量通过2个型值点.在型值点列满足较弱的条件下,曲线具有在事先给定首末切向的情况下圆弧总段数比型值点个数少且保形的特点.     

二次均匀B样条曲线的双圆弧逼近方法*

提出了一种用双圆弧对二次均匀B样条曲线的分段逼近方法。首先,对一条具有n 1个控制顶点的二次均匀B样条曲线按照相邻两节点界定的区间分成n-1段只有三个控制顶点的二次均匀B样条曲线段;然后对每一曲线段构造一条双圆弧进行逼近。所构造的双圆弧满足端点及端点切向量条件,即双圆弧的两个端点分别是所逼近的曲线段的端点,而且双圆弧在两个端点处的切向量是所逼近的曲线段在端点处的单位切向量。同时,双圆弧的连接点是双圆弧连接点轨迹圆与其所逼近的曲线段的交点。这些新构造出来的双圆弧连接在一起构成了一条圆弧样条曲线,即二次均匀B样条曲线的逼近曲线。另外给出了逼近误差分析和实例说明。     

圆柱面上G1插值曲线

用向量吸收投影的方法解决了由圆柱面上给定的点及该点处切平面上的单位矢量,来构造圆柱面上的一条光滑插值曲线问题.首先,由圆柱面上给定的点及该点处切平面上的单位矢量构造一条插值给定点及给定单位向量的空间3次Bézier样条插值曲线,然后再将空间3次Bézier曲线吸收投影到圆柱面上,就得到所求的限制在圆柱面上满足插值条件G1连续的插值曲线.     

圆弧的五次PH曲线等弧长逼近

针对圆弧多项式逼近中弧长不相等的问题,对给定圆弧在逼近多项式插值圆弧端点和端点切向量的条件下,结合PH曲线弧长可用多项式精确表示的性质,提出等弧长多项式逼近方法,并给出了五次PH多项式逼近圆弧的精确表示.最后通过实例说明了该方法的有效性.     

二次Bézier样条光顺插值

根据平面曲线的应变能极小原则构造了一条分段二次B啨ｚｉｅｒ样条曲线插值给定的一系列平面型值点列和端点几何约束条件 为了改进插值曲线的整体光顺性 ,提出了确定插值二次B啨ｚｉｅｒ样条曲线在每一个型值点处的最优切矢方向的一种方法     

一类加权有理四次插值样条曲线的形状控制

将插值曲线约束于给定的区域之内是曲线形状控制中的重要问题。利用带导数的和不带导数的分母为线性的有理四次插值样条构造了一类新的加权有理四次插值样条函数,插值函数具有简单的显示表示,这类新的插值样条中含有权系数,因而增加了处理问题的灵活性,给约束控制带来了方便。给出了将该种插值曲线约束于给定的折线、二次曲线之上、之下或之间的充分条件。证明了满足约束条件的加权有理样条的存在性。     

带端点插值条件的Bézier曲线降多阶逼近

研究了两端点具有任意阶插值条件的Bézier曲线降多阶逼近的问题.对于给定的首末端点的各阶插值条件,给出了一种新的一次降多阶逼近算法,应用Chebyshev多项式逼近理论达到了满足端点插值条件下的近似最佳一致逼近.此算法易于实现,误差计算简单,且所得降阶曲线具有很好的逼近效果,结合分割算法,可获得相当高的误差收敛速度.     

一种有理三次样条的约束插值

将插值曲线约束于给定的区域之内是曲线形状控制中的重要问题。构造了一种仅依赖于函数值的分母为二次的有理三次插值样条,是[C1]连续的,使用起来较方便,并含有参数,具有较好的可约束控制性质。研究了该样条曲线的区域控制问题,讨论了该插值曲线约束于给定折线二次曲线上（下）方或之间的条件,并给出了数值算例。所给约束条件容易满足,便于使用。     

局部形状可调的三角多项式插值曲线

对于给定的有序插值点列,给出了构造一类三角多项式插值曲线的方法。三角多项式曲线的控制点直接由插值点列计算产生,避免了求解方程组。所构造的插值曲线可作局部形状修改且具有G2m-1连续性。     

An optimization approach for biarc curve-fitting of B-spline curves

We present an approach to the optimal fitting of a biarc-spline to a given B-spline curve. The objective is to minimize the area between the original B-spline curve and the fitted curve. Such an objective has obvious practical implications. This approach differs from conventional biarc curve-fitting techniques in two main aspects and has some desirable features. Firstly, it exploits the inherent freedom in the choice of the biarc that can be fitted to a given pair of end-points and their tangents. The conventional approach to biarc curve-fitting introduces additional constraints, such as the minimal difference in curvature or others to uniquely determine successive biarcs. In this approach, such constraints are not imposed. Instead, the freedom is exploited in the problem formulation to achieve a better fit. Secondly, the end-points do not lie on the curve so that appropriate tolerance control can be imposed through the use of additional constraints. Almost all previous biarc-fitting methods consider end-points that are on the original curve. As a result of these two aspects, the resulting biarc curve fits closely to the original curve with relatively fewer segments. This has a desirable effect on the surface finish, verification of CNC codes and memory requirement. Numerical results of the application of this approach to several examples are presented.     

Data Approximation Using Biarcs

. An algorithm for data approximation with biarcs is presented. The method uses a specific formulation of biarcs appropriate for parametric curves in Bézier or NURBS formulation. A base curve is applied to obtain tangents and anchor points for the individual arcs joining in G 1 continuity. Data sampled from circular arcs or straight line segments is represented precisely by one biarc. The method is most useful in numerical control to drive the cutter along straight line or circular paths.     

Error-bounded biarc approximation of planar curves

Presented in this paper is an error-bounded method for approximating a planar parametric curve with a G¹ arc spline made of biarcs. The approximated curve is not restricted in specially bounded shapes of confined degrees, and it does not have to be compatible with non-uniform rational B-splines (NURBS). The main idea of the method is to divide the curve of interest into smaller segments so that each segment can be approximated with a biarc within a specified tolerance. The biarc is obtained by polygonal approximation to the curve segment and single biarc fitting to the polygon. In this process, the Hausdorff distance is used as a criterion for approximation quality. An iterative approach is proposed for fitting an optimized biarc to a given polygon and its two end tangents. The approach is robust and acceptable in computation since the Hausdorff distance between a polygon and its fitted biarc can be computed directly and precisely. The method is simple in concept, provides reasonable accuracy control, and produces the smaller number of biarcs in the resulting arc spline. Some experimental results demonstrate its usefulness and quality.     

A practicable approach to G biarc approximations for making accurate, smooth and non-gouged profile features in CNC contouring

Extensive research on G¹ biarc approximations to free-form curves has been conducted for the production of accurate, smooth and non-gouged profile features in CNC contouring. However, all the published work has only focused on improving the fitting accuracy between the biarc curve and the nominal free-form curve of a profile and minimizing the biarc number; as a result, the radii of the concave arcs of some biarcs could be less than the pre-determined tool radius, and the tool would overcut these arcs in machining, eventually gouging the profile. In this work, a new, practicable approach is proposed to completely solve this problem. The main feature of this approach is to find the gouging-free parameter interval of a biarc family, among which the radii of all the concave arcs are larger than the tool radius, and then to search in this interval for a best fitting biarc so that its approximation accuracy is within the tolerance. This approach is robust and easy to implement and can substantially promote the use of G¹ biarc curves for CNC machining.     

平面列表点曲线的最优双圆弧拟合

本文利用相切的双圆弧拟合平面列表点曲线，最优原则取“应变能”与弧长加权之和为最小。这个方法克服了单圆弧样条拟合及其它优化原则方法的缺点，在数控加工中将得到很好的应用。     

Biarc approximation of polygons within asymmetric tolerance bands

We present an algorithm for approximating a simple planar polygon by a tangent-continuous approximation curve that consists of biarcs. Our algorithm guarantees that the approximation curve lies within a user-specified tolerance from the original polygon. If requested, the algorithm can also guarantee that the original polygon lies within a user-specified distance from the approximation curve. Both symmetric and asymmetric tolerances can be handled. In either case, the approximation curve is guaranteed to be simple. Simplicity of the approximation curve is achieved by restricting it to a ‘tolerance band’ which represents the user-specified tolerance and which takes into account bottlenecks of the input polygon. The tolerance band itself is computed by means of a regular grid and so-called k-dops. The basic algorithm is readily extended to compute biarc approximations of collections of polygonal curves simultaneously. Experimental results demonstrate that this algorithm computes biarc approximations of an n-vertex polygon with a close-to-minimum number of biarcs in roughly time.     

Efficient circular arc interpolation based on active tolerance control

In this paper, we present an efficient sub-optimal algorithm for fitting smooth planar parametric curves by G¹ arc splines. To fit a parametric curve by an arc spline within a prescribed tolerance, we first sample a set of points and tangents on the curve adaptively as well as with enough density, so that an interpolation biarc spline curve can be with any desired high accuracy. Then, we construct new biarc curves interpolating local triarc spirals explicitly based on the control of permitted tolerances. To reduce the segment number of fitting arc spline as much as possible, we replace the corresponding parts of the spline by the new biarc curves and compute active tolerances for new interpolation steps. By applying the local biarc curve interpolation procedure recursively and sequentially, the result circular arcs with no radius extreme are minimax-like approximation to the original curve while the arcs with radius extreme approximate the curve parts with curvature extreme well too, and we obtain a near optimal fitting arc spline in the end. Even more, the fitting arc spline has the same end points and end tangents with the original curve, and the arcs will be jointed smoothly if the original curve is composed of several smooth connected pieces. The algorithm is easy to be implemented and generally applicable to circular arc interpolation problem of all kinds of smooth parametric curves. The method can be used in wide fields such as geometric modeling, tool path generation for NC machining and robot path planning, etc. Several numerical examples are given to show the effectiveness and efficiency of the method.     

3D Slit Scanning with Planar Constraints★

We present a planarity constraint and a novel three‐dimensional (3D) point reconstruction algorithm for a multiview laser range slit scanner. The constraint is based on the fact that all observed points on a projected laser line lie on the same plane of laser light in 3D. The parameters of the plane of laser light linearly parametrize a homography between a pair of images of the laser points. This homography can be recovered from point correspondences derived from epipolar geometry. The use of the planar constraint reduces outliers in the reconstruction and allows for the reconstruction of points seen in only one view. We derive an optimal reconstruction of points subject to the planar constraint and compare the accuracy to the suboptimal approach in prior work. We also construct a catadioptric stereo rig with high quality optical components to remove error due to camera synchronization and non‐uniform laser projection. The reconstruction results are compared to prior work that uses inexpensive optics and two cameras.     

Biarc approximation of NURBS curves

An algorithm for approximating arbitrary NURBS curves with biarcs is presented. The main idea is to approximate the NURBS curve with a polygon, and then to approximate the polygon with biarcs to within the required tolerance. The method uses a parametric formulation of biarcs appropriate in geometric design using parametric curves. The method is most useful in numerical control to drive the cutter along straight line or circular paths.