Knot Insertion Algorithms for ECT B-spline Curves

Knot insertion algorithm is one of the most important technologies of B-spline method. By inserting a knot the local prop- erties of B-spline curve and the control flexibility of its shape can be fiu＇ther improved, also the segmentation of the curve can be rea- lized. ECT spline curve is drew by the multi-knots spline curve with associated matrix in ECT spline space; Muehlbach G and Tang Y and many others have deduced the existence and uniqueness of the ECT spline function and developed many of its important properties .This paper mainly focuses on the knot insertion algorithm of ECT B-spline curve.It is the widest popularization of B-spline Behm algorithm and theory. Inspired by the Behm algorithm, in the ECT spline space, structure of generalized P61ya poly- nomials and generalized de Boor Fix dual functional, expressing new control points which are inserted after the knot by linear com- bination of original control vertex the single knot, and there are two cases, one is the single knot, the other is the double knot. Then finally comes the insertion algorithm of ECT spline curve knot. By application of the knot insertion algorithm, this paper also gives out the knot insertion algorithm of four order geometric continuous piecewise polynomial B-spline and algebraic trigonometric spline B-spline, which is consistent with previous results.

Total Positivity of UE Spline Basis

A new geometric method to prove the total positivity of UE spline basis was proposed. UE spline basis is a kind of basis defined over algebraic-trigonometric unified space. UE spline basis shares most properties of the usual polynomial B-Splines. Total positivity is an important property for spline basis, it is highly related with shape preserving and variation diminishing properties. Knot inserted algorithm is the most useful algorithm for spline curves since many other useful properties are based on it. It is necessary to prove the total positivity of UE spline basis using knot inserted algorithm intuitively, not only enrich the UE spline basis theory, but also can be treated as supplement to the total positivity in algebraic sense. This approach also can be extended to other analogical bases.

Improved time-optimal B-spline feedrate scheduling for NURBS tool paths in CNC machining

Feedrate scheduling in computer numerical control(CNC)machining is of great importance to fully develop the capabilities of machine tools while maintaining the motion stability of each actuator.Smooth and time-optimal feedrate scheduling plays a critical role in improving the machining efficiency and precision of complex surfaces considering the irregular curvature characteristics of tool paths and the limited drive capacities of machine tools.This study develops a general feedrate scheduling method for non-uniform rational B-splines(NURBS)tool paths in CNC machining aiming at minimizing the total machining time without sacrificing the smoothness of feed motion.The feedrate profile is represented by a B-spline curve to flexibly adapt to the frequent acceleration and deceleration requirements of machining along complex tool paths.The time-optimal B-spline feedrate is produced by continuously increasing the control points sequentially from zero positions in the bidirectional scanning and sampling processes.The required number of knots for the time-optimal B-spline feedrate can be determined using a progressive knot insertion method.To improve the computational efficiency,the B-spline feedrate profile is divided into a series of independent segments and the computation in each segment can be performed concurrently.The proposed feedrate scheduling method is capable of dealing with not only the geometry constraints but also high-order drive constraints for any complex tool path with little computational overhead.Simulations and machining experiments are conducted to verify the effectiveness and superiorities of the proposed method.