COMPLEX RATIONAL TYPE INTERPOLATION AT DISTURBED FEJR POINTS ON A CURVE

The results of accurate order of uniform approximation and simultaneous approximation in the early work ＂Jackson Type Theorems on Complex Curves＂ are improved from Fejer points to disturbed Fejer points in this article. Furthermore, the stability of convergence of Tn,∈（f,z） with disturbed sample values f（z^＊） ＋ Sk are also proved in this article.

Research on the Arc Interpolation for the Nonstandard Section Curve of the Piston

The transverse section of piston skirt is not a standard circle and is with high precision. So the section curve should be interpolated through the high accuracy method of circular arc interpolation before NC machining. In order to smooth the connection of adjacent arcs and shorten the NC machining program, an interpolation method based on Chebyshev theory of function approximation is proposed here. According to the analysis of the interpolation error, the algorithm is simple and with high precision. By this way the fewest interpolating circular arc segments can be got, and the manufacture requirement is satisfied with the circular arc interpolating curves.

Calculation of Space NURBS Curve Interpolation Error

Aiming at the problem of low accuracy of interpolation error calculation of existing NURBS curves, an approximate method for the distance between a point and a NURBS interpolation curve is proposed while satisfying the accuracy of the solution. Firstly, the minimum parameter interval of the node vector corresponding to the data point under test in the original data point sequence is determined, and the parameter interval is subdivided according to the corresponding step size, and the corresponding parameter value is obtained. Secondly, the distance from the measured point to the NURBS curve is calculated, and the nearest distance is found out. The node interval is subdivided again on one side of the nearest distance. Finally, the distance between the data point to be measured and each subdivision point is calculated again, and the minimum distance is taken as the interpolation error between the point and the NURBS curve. The simulation results of actual tool position data show that this method can more accurately obtain the error of spatial NURBS interpolation curve.

Reconstruction of B-spline surface by interpolating boundary curves and approximating inner points

In this paper, we present an algorithm for reconstruction of B-spline surface such that it interpolates the four given bound- ary curves and simultaneously approximates some given inner points. The main idea of our method is： first, we construct an initial surface which interpolates the four given boundary curves; then, while keeping the boundary control points of the initial surface un- changed, we reposition the inner control points of the surface with energy optimization method. Examples show that our algorithm is practicable and effective.

Curve interpolation model for visualising disjointed neural elements

Neuron cell are built from a myriad of axon and denddte structures. It transmits electrochemical signals between the brain and the nervous system. Three-dimensional visualization of neuron structure could help to facilitate deeper understanding of neuron and its models. An accurate neuron model could aid understanding of brain＇s functionalities, diagnosis and knowledge of entire nervous system. Existing neuron models have been found to be defective in the aspect of realism. Whereas in the actual biological neuron, there is continuous growth as the soma extending to the axon and the dendrite; but, the current neuron visualization models present it as disjointed segments that has greatly mediated effective realism. In this research, a new reconstruction model comprising of the Bounding Cylinder, Curve Interpolation and Gouraud Shading is proposed to visualize neuron model in order to improve realism. The reconstructed model is used to design algorithms for generating neuron branching from neuron SWC data. The Bounding Cylinder and Curve Interpolation methods are used to improve the connected segments of the neuron model using a series of cascaded cylinders along the neuron＇s connection path. Three control points are proposed between two adjacent neuron segments. Finally, the model is rendered with Gouraud Shading for smoothening of the model surface. This produce a near-perfection model of the natural neurons with attended realism. The model is validated by a group of bioinformatics analysts＇ responses to a predefined survey. The result shows about 82% acceptance and satisfaction rate.

A SMOOTH C^1 INTERPOLATION FOR TWO-DIMENSIONAL CONTACT PROBLEMS USING PARAMETRIC CURVE TECHNIQUE

A smooth C^1 interpolation for two-dimensional contact problems using parametric curve technique was developed and implemented.The parametric curve can ensure C^1 continuity of the contact surfaces and provide a unique surface normal vector.Some numerical examples were used to illustrate the advantages of the newly developed representation of contact surface. The results reveal a significant improvement in the prediction of contact stresses and contact area.The predicted contact stresses are less sensitive to the mismatch in meshes of the different contacting bodies.

Convexity-preserving interpolation of trigonometric polynomial curves with a shape parameter

In computer aided geometric design(CAGD) ,it is often needed to produce a convexity-preserving interpolating curve according to the given planar data points. However,most existing pertinent methods cannot generate convexity-preserving in-terpolating transcendental curves;even constructing convexity-preserving interpolating polynomial curves,it is required to solve a system of equations or recur to a complicated iterative process. The method developed in this paper overcomes the above draw-backs. The basic idea is:first to construct a kind of trigonometric polynomial curves with a shape parameter,and interpolating trigonometric polynomial parametric curves with C2(or G1) continuity can be automatically generated without having to solve any system of equations or do any iterative computation. Then,the convexity of the constructed curves can be guaranteed by the appropriate value of the shape parameter. Performing the method is easy and fast,and the curvature distribution of the resulting interpolating curves is always well-proportioned. Several numerical examples are shown to substantiate that our algorithm is not only correct but also usable.

(G^2-continuous) SHAPE PRESERVING CUBIC INTERPOLATION SPLINE CURVE

（Ｇ~２－ｃｏｎｔｉｎｕｏｕｓ）ＳＨＡＰＥＰＲＥＳＥＲＶＩＮＧＣＵＢＩＣＩＮＴＥＲＰＯＬＡＴＩＯＮＳＰＬＩＮＥ ＣＵＲＶＥＦａｎｇＫｕｉ（ＤｅｐａｒｔｍｅｎｔｏｆＳｙｓｔｅｍＥｎｇｉｎｅｅｒｉｎｇａｎｄＭａｔｈｅｍａｔｉｃｓ，ＮＵＤＴ，Ｃｈａｎｇｓｈ?..

C^n-CONTINUOUS B-TYPE SPLINE CURVES WITH ITSLOCALIZATION INTERPOLATION AND APPROXIMATION

This paper presents a class of Cn- continuous B- type spline curves with some paramet- ric factors.The length of their local support is equal to4.Taking the different values of the parametric factors,the curves can become free- type curves or interpolate a set of given points even mix the both cases.When the parametric factors satisfy the certain conditions,the degrees of the curves can be decreased as low as possible.Besides,when all the parametric factors tend to zero,the curves globally approximate to the control polygon.

NURBS CURVE INTERPOLATOR WITH ADAPTIVE ACCELERATION-DECELERATION CONTROL

The feedrate profile of non-uniform rational B-spline （NURBS） interpolation due to the contour errors is analyzed. A NURBS curve interpolator with adaptive acceleration-deceleration control is presented. In interpo- lation preprocessing, the sensitive zones of feedrate variations are processed with acceleration-deceleration control. By using the proposed algorithm, the machining accuracy is guaranteed and the feedrate is adaptively adjusted to he smoothed. The mechanical shock imposed in the servo system is avoided by the first and the second time derivatives of feedrates. A simulation of NURBS interpolation is given to demonstrate the validity and the effectiveness of the algorithm. The proposed interpolator can also be applied to the trajectory planning of the other parametric curves.

The quadratic B-spline curve fitting for the shape of log cross sections

This paper describes a new method for simulation of the cross section shape of log. The self-developed MQK3102 log shape recognizing machine was used to acquire the finite discrete sampling points on the cross section of log and those points were fitted with the quadratic B-spline parametric curve. This method can clearly stimulate the real shape of the log cross section and is characterized by limited sampling points and high speed computing. The computed result of the previous curve does not affect the next one, which may avoid the graphic distortion caused by the accumulative error. The method can be used to simulate the whole body shape of log approximately by sampling the cross sections along the length direction of log, thus providing a reference model for optimum saw cutting of log.

CURVE AND SURFACE INTERPOLATIONBY SUBDIVISION ALGORITHMS

Interpolatory subdivision algorithms for the generation of curves and surfaces play a veryimportant rule in shape design and modelling in CAD/CAM systems. In this paper, by using the dif-ference and divided difference analysis, a systematic method to construct Cn (n≥ 0) interpolatorycurves by subdivision from given data is described and the mask (filter) of the algorithm is presentedexplicitly. This algorithm generates a Cn smooth curve which interpolates the initial control points.Control parameters are also provided so that the shape of the final curve can be adjusted according torequirements. An immediate generalisation of the method is the construction of smooth interpolatorysubdivision algorithms over uniform triangular networks (tensor product type data) in Rm. The mainresults of this algorithm for smooth interpolatory surface subdivision algorrthm are also included.AMS(MOS) : 65D05 , 65D15 , 65D17.

Efficient Construction of B-Spline Curves with Minimal Internal Energy

In this paper,we propose an efficient method to construct energy-minimizing B-spline curves by using discrete mask method.The linear relations between control points are firstly derived for different energy-minimization problems,then the construction of B-spline curve with minimal internal energy can be addressed by solving a sparse linear system.The existence and uniqueness of the solution for the linear system are also proved.Experimental results show the efficiency of the proposed approach,and its application in 1 G blending curve construction is also presented.

LOOK-AHEAD ALGORITHM FOR VELOCITY CONTROL BASED ON PARAMETERIZED CURVE INTERPOLATOR

To avoid suffering gouge and transient overshooting in high speed cutting machining, a novel parametefized curve interpolator model with velocity look-ahead algorithm is proposed. Based on a prearrangement step interpolation algorithm for parameterized curves and considering high curvature points, parameterized curve tool path is divided into acceleration segments and deceleration segments by look-ahead algorithm. Under condition of characteristics of acceleration and deceleration stored in control system, deceleration before high curvature points and acceleration after high curvature points are realized in real-time in high speed cutting machining. Based on new parameterized curve interpolator model with velocity look-ahead algorithm, a real cubic spline is machined simulativly. The simulation results show that velocity look-ahead algorithm improves velocity changing more smoothly.

Study on Real-time Look-ahead and Adaptive Parametric Curve Interpolator

The principle of real-time look-ahead was introduced and analysed. An adaptive parametric curve interpolator with a real-time look-ahead function was developed for non-uniform rational B-spline (NURBS) curves interpolation, which considering the maximum acceleration/deceleration of the machine tool. In order to deal with the acceleration/deceleration around the feedrate sensitive corners, the look-ahead function was designed and illustrated. It can detect and adjust the feedrate adaptively. With the help of real-time look-ahead, the acceleration/deceleration can be limited to the range of the machine tool capacity. Thus, feedrate fluctuation is reduced. A NURBS curve interpolation experiment was provided to verify the feasibility and advantages of the proposed interpolator with a real-time look-ahead function.

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.

Performance of global look-up table strategy in digital image correlation with cubic B-spline interpolation and bicubic interpolation

Global look-up table strategy proposed recently has been proven to be an efficient method to accelerate the interpolation, which is the most time-consuming part in the iterative sub-pixel digital image correlation （DIC） algorithms. In this paper, a global look-up table strategy with cubic B-spline interpolation is developed for the DIC method based on the inverse compositional Gauss-Newton （IC-GN） algorithm. The performance of this strategy, including accuracy, precision, and computation efficiency, is evaluated through a theoretical and experimental study, using the one with widely employed bicubic interpolation as a benchmark. The global look-up table strategy with cubic B-spline interpolation improves significantly the accuracy of the IC-GN algorithm-based DIC method compared with the one using the bicubic interpolation, at a trivial price of computation efficiency.

One Fairing Method of Cubic B-spline Curves Based on Weighted Progressive Iterative Approximation

A new method to the problem of fairing planar cubic B-spline curves is introduced in this paper. The method is based on weighted progressive iterative approximation （WPIA for short） and consists of following steps： finding the bad point which needs to fair, deleting the bad point, re-inserting a new data point to keep the structm-e of the curve and applying WPIA method with the new set of the data points to obtain the faired curve. The new set of the data points is formed by the rest of the original data points and the new inserted point. The method can be used for shape design and data processing. Numerical examples are provided to demonstrate the effectiveness of the method.

B-spline curve-based routing in ad hoc networks

Routing algorithms capable of providing quality of service （QoS） will play an important role in future communication networks. For the trajectory-based routing （ TBR）, An effective method of en- coding trajectories into packets is proposed. The method uses a B-spline curve, which provides a lot of flexibility. The simulation results show that the performance of the proposed algorithms is im- proved significantly compared with the existing algorithm.