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.

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.

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.

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

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

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.

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.

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.

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.

MODIFIABLE QUARTIC AND QUINTIC CURVES WITH SHAPE-PARAMETERS

This paper presents a method for creating modificable quartic and quintic curves with shape parameters. The curves can achieve C 2 even C 3 continuity and unify both interpolation and approximation to the control points without solving a system of equations or inserting additional control points. They have the local properties like the cubic B spline. Besides, the quintic curve would be able globally to tend the control polygon.

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.

Direction monotonicity for a rational Bézier curve

The monotonicity of a rational Bezier curve, usually related to an explicit function, is determined by the used coordinate system. However, the shape of the curve is independent of the coordinate system. To meet the affine invariant property, a kind of generalized mono- tonicity, called direction monotonicity, is introduced for rational Bezier curves. The direction monotonicity is applied to both planar and space curves and to both Cartesian and affine co- ordinate systems, and it includes the traditional monotonicity as a subcase. By means of it, proper affine coordinate systems may be chosen to make some rational Bezier curves monotonic. Direction monotonic interpolation may be realized for some of the traditionally nonmonotonic data as well.

CONSTRUCTION OF G^2 CONTINUOUS CURVES ON SURFACE WITH PLANAR CUBIC BZIER CURVES

The problem of constructing curve on parametric surface (or surface that canbe parameterized) such that it interpolates a sequence of points with prescribed tangent directionand curvature vector (or geodesic curvature) at every point and the issue of curve blending on thiskind of surface are researched. The mapping and tangent mapping from the surface to its parametricplane are introduced and thus several conclusions with differential geometry are deduced. Based onthose conclusions, the problem of interpolating (or blending) curve on a parametric surface isconverted to a similar one on its parametric plane. The final solution curve of either interpolationor blending issue is explicit and can still be expressed by parametric form. And so, unlikeexisting methods, the presented method needs not to use any surface/ surface intersectionalgorithms, usually a troublesome process, for displaying such interpolation curve. Experimentresults show the presented methods are feasible and applicable to CAD/CAM and computer graphics

C2 Continuous Quartic Hermite Spline Curves with Shape Parameters

In order to relieve the deficiency of the usual cubic Hermite spline curves,the quartic Hermite spline curves with shape parameters is further studied in this work. The interpolation error and estimator of the quartic Hermite spline curves are given. And the characteristics of the quartic Hermite spline curves are discussed.The quartic Hermite spline curves not only have the same interpolation and continuity properties of the usual cubic Hermite spline curves, but also can achieve local or global shape adjustment and C;continuity by the shape parameters when the interpolation conditions are fixed.

Typical curve with G1 constraints for curve completion

This paper presents a novel algorithm for planar G1 interpolation using typical curves with monotonic curvature.The G1 interpolation problem is converted into a system of nonlinear equations and sufficient conditions are provided to check whether there is a solution.The proposed algorithm was applied to a curve completion task.The main advantages of the proposed method are its simple construction,compatibility with NURBS,and monotonic curvature.

Integer Wavelet-Based Image Interpolation in Lifting Structure for Image Resolution Enhancement

A floating-point wavelet-based and an integer wavelet-based image interpolations in lifting structures and polynomial curve fitting for image resolution enhancement are proposed in this paper. The proposed prediction methods estimate high-frequency wavelet coefficients of the original image based on the available low-frequency wavelet coefficients, so that the original image can be reconstructed by using the proposed prediction method. To further improve the reconstruction performance, we use polynomial curve fitting to build relationships between actual high-frequency wavelet coefficients and estimated high-frequency wavelet coefficients. Results of the proposed prediction algorithm for different wavelet transforms are compared to show the proposed prediction algorithm outperforms other methods.

Fractal Interpolation Functions: A Short Survey

The object of this short survey is to revive interest in the technique of fractal interpolation. In order to attract the attention of numerical analysts, or rather scientific community of researchers applying various approximation techniques, the article is interspersed with comparison of fractal interpolation functions and diverse conventional interpolation schemes. There are multitudes of interpolation methods using several families of functions: polynomial, exponential, rational, trigonometric and splines to name a few. But it should be noted that all these conventional nonrecursive methods produce interpolants that are differentiable a number of times except possibly at a finite set of points. One of the goals of the paper is the definition of interpolants which are not smooth, and likely they are nowhere differentiable. They are defined by means of an appropriate iterated function system. Their appearance fills the gap of non-smooth methods in the field of approximation. Another interesting topic is that, if one chooses the elements of the iterated function system suitably, the resulting fractal curve may be close to classical mathematical functions like polynomials, exponentials, etc. The authors review many results obtained in this field so far, although the article does not claim any completeness. Theory as well as applications concerning this new topic published in the last decade are discussed. The one dimensional case is only considered.

Variational Formulations Yielding High-Order Finite-Element Solutions in Smooth Domains without Curved Elements

One of the reasons for the great success of the finite element method is its versatility to deal with different types of geometries. This is particularly true of problems posed in curved domains. Nevertheless it is well-known that, for standard variational formulations, the optimal approximation properties known to hold for polytopic domains are lost, if meshes consisting of ordinary elements are still used in the case of curved domains. That is why method’s isoparametric version for meshes consisting of curved triangles or tetrahedra has been widely employed, especially in case Dirichlet boundary conditions are prescribed all over a curved boundary. However, besides geometric inconveniences, the isoparametric technique helplessly requires the manipulation of rational functions and the use of numerical integration. In this work we consider a simple alternative that bypasses these drawbacks, without eroding qualitative approximation properties. More specifically we work with a variational formulation leading to high order finite element methods based only on polynomial algebra, since they do not require the use of curved elements. Application of the new approach to Lagrange methods of arbitrary order illustrates its potential to take the best advantage of finite-element discretizations in the solution of wide classes of problems posed in curved domains.