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.

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.

A Novel Contour Tracing Algorithm for Object Shape Reconstruction Using Parametric Curves

Parametric curves such as Bézier and B-splines, originally developedfor the design of automobile bodies, are now also used in image processing andcomputer vision. For example, reconstructing an object shape in an image,including different translations, scales, and orientations, can be performedusing these parametric curves. For this, Bézier and B-spline curves can be generatedusing a point set that belongs to the outer boundary of the object. Theresulting object shape can be used in computer vision fields, such as searchingand segmentation methods and training machine learning algorithms. Theprerequisite for reconstructing the shape with parametric curves is to obtainsequentially the points in the point set. In this study, a novel algorithm hasbeen developed that sequentially obtains the pixel locations constituting theouter boundary of the object. The proposed algorithm, unlike the methods inthe literature, is implemented using a filter containing weights and an outercircle surrounding the object. In a binary format image, the starting point ofthe tracing is determined using the outer circle, and the next tracing movementand the pixel to be labeled as the boundary point is found by the filter weights.Then, control points that define the curve shape are selected by reducing thenumber of sequential points. Thus, the Bézier and B-spline curve equationsdescribing the shape are obtained using these points. In addition, differenttranslations, scales, and rotations of the object shape are easily provided bychanging the positions of the control points. It has also been shown that themissing part of the object can be completed thanks to the parametric curves.

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.

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.

RECONSTRUCTION OF SYMMETRIC B-SPLINE CURVES AND SURFACES

A method to reconstruct symmetric B-spline curves and surfaces is presented. The symmetry property is realized by using symmetric knot vector and symmetric control points. Firstly, data points are divided into two parts based on the symmetry axis or symmetry plane extracted from data points. Then the divided data points are parameterized and a symmetric knot vector is selected in order to get symmetric B-spline basis functions. Constraint equations regarding the control points are deduced to keep the control points of the B-spline curve or surface to be symmetric with respect to the extracted symmetry axis or symmetry plane. Lastly, the constrained least squares fitting problem is solved with the Lagrange multiplier method. Two examples from industry are given to show that the proposed method is efficient, robust and able to meet the general engineering requirements.

THE RELATIONSHIP BETWEEN PROJECTIVE GEOMETRIC AND RATIONAL QUADRATIC B-SPLINE CURVES

Abstract For two rational quadratic B spline curves with same control vertexes, the cross ratio of four collinear points are represented: which are any one of the vertexes, and the two points that the ray initialing from the vertex intersects with the corresponding segments of the two curves, and the point the ray intersecting with the connecting line between the two neighboring vertexes. Different from rational quadratic Bézier curves, the value is generally related with the location of the ray, and the necessary and sufficient condition of the ratio being independent of the ray's location is showed. Also another cross ratio of the following four collinear points are suggested, i.e. one vertex, the points that the ray from the initial vertex intersects respectively with the curve segment, the line connecting the segments end points, and the line connecting the two neighboring vertexes. This cross ratio is concerned only with the ray's location, but not with the weights of the curve. Furthermore, the cross ratio is projective invariant under the projective transformation between the two segments.

An adaptive generation method for free curve trajectory based on NURBS

To realize the high precision and real-time interpolation of the NURBS （non-uniform rational B-spline） curve, a kinetic model based on the modified sigmoid function is proposed. The constraints of maximum feed rate, chord error, curvature radius and interpolator cycle are discussed. This kinetic model reduces the cubic polynomial S-shape model and the trigonometry function S-shape model from 15 sections into 3 sections under the precondition of jerk, acceleration and feedrate continuity. Then an optimized Adams algorithm using the difference quotient to replace the derivative is presented to calculate the interpolator cycle parameters. The higher-order derivation in the Taylor expansion algorithm can be avoided by this algorithm. Finally, the simplified design is analyzed by reducing the times of computing the low-degree zero-value B-spline basis function and the simplified De Boor-Cox recursive algorithm is proposed. The simulation analysis indicates that by these algorithms, the feed rate is effectively controlled according to tool path. The calculated amount is decreased and the calculated speed is increased while the machining precision is ensured. The experimental results show that the target parameter can be correctly calculated and these algorithms can be applied to actual systems.

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.

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.

Adaptive B-snake for planar curve approximation

An adaptive B-spline active contour model for planar curve approximation is proposed. Starting with an initial B-spline curve, the finite element method is adopted to make the active B-spline curve converge towards the target curve without the need of data points parameterization. A strategy of automatic control point insertion during the B-spline active contour deformation, adaptive to the shape of the planar curve, is also given. Experimental results show that this method is efficient and accurate in planar curve approximation.

On the Parametric Modeling of Turbine Blade Section Curve

Geometric parameters of the turbine blade are classified according to their destined functions, and the mathematical definition of those parameters in the section curve is introduced in detail. Some parts of the section curve shape can be adjusted freely, offering more flexibility to designers.

A SPACE THEORY BASIS FOR CURVE FITTING PROBLEMS

itherto, a precision Concept for curve fitting problems has not been set. By using the theory of functional analysis, the author of this paper established a space theory basis for curve fitting problems. Also given in the paper is the precision concept of the curve fitting problems and the method for constructing the fitting of a curve satisfying given precision requirements.

A Methodology for Curve and Surface Fitting with Adaptive Fairing for Digitized Points

A new approach for NURBS(Non-uniform rational B-spline) curve and surface fitting for measured points was presented which employs a fairing method applied to digitized point data with discrete curvature. If measured points are used as control points to construct an NURBS curve, then the curvature of each data point corresponding to control point of the constructed curve can be computed. According to the convex hull and local properties of NURBS, based on the curvatures obtained, the measured points can be faired. If faired measured points are used as target points to modify, the constructed curve passing through these faired points can produce a smooth NURBS curve. This paper also presented the justification for utilizing the curvatures of constructed NURBS curve instead of the conventional interpolated curve to fair the measured points. Based on the presented algorithms, some qualities of the constructed curves can be improved.

Multiresolution for Closed Curves and Surfaces Using Wavelets

Multiresolution modeling is becoming a powerful tool for fast display, and geometric data compression and transmission of complex shapes. Most of the existing literatures investigating the multiresolution for B-spline curves and surfaces are concentrated on open ones. In this paper, we focus on the multiresolution representations and editing of closed B-spline curves and surfaces using wavelets. A repetition approach is adopted for the multiresolution analysis of closed B-spline curves and surfaces. Since the closed curve or surface itself is periodic, it can overcome the drawback brought by the repetition method, i.e. introducing the discontinuities at the boundaries. Based on the models at different multiresolution levels, the multiresolution editing methods of closed curves and surfaces are introduced. Users can edit the overall shape of a closed one while preserving its details, or change its details without affecting its overall shape.

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.

挖掘机时间最优与脉动最优轨迹规划

为了在提高挖掘机工作效率的同时减小各个关节的振动,提出了一种使挖掘机关节运行时间和关节脉动达到某种综合最优的轨迹规划方法,在同时考虑挖掘机动臂、斗杆、铲斗的运动学约束以及动作时间约束条件的前提下,采用五次非均匀B样条曲线对离散序列点进行插值,然后运用自适应粒子群优化算法(ASPO)对目标函数进行优化求解得到一条动作时间较短且脉动连续关节轨迹,最后对优化后得到的关节轨迹进行仿真实验,结果表明,该方法最终可以得到比较理想的运动轨迹,从而验证了该方法的有效性。

基于广义波阻抗理论的SHPB试验中弹性压缩阶段试件应力-应变曲线的应力波效应及其影响机理

定量研究分离式霍普金森压杆(split Hopkinson pressure bar,SHPB)试验中弹性压缩阶段试件中的应力波效应是解耦准确材料弹性曲线的基础。在满足平面波假设的基础上,基于广义波阻抗理论,对杆与试件面积不匹配时试件弹性压缩阶段应力波演化造成的结构效应开展了定量理论研究,分析了不同情况下弹性阶段内试件唯象工程及实际材料应力-应变曲线的偏差特征与主要因素,并揭示了影响这种偏差的影响规律及其机理。研究表明:对于线性入射加载波,当无量纲时间为0.5的倍数时,即使其他参数改变,试件唯象与材料实际的应力-应变曲线仍对应相等;试件两端的应力差较大时,若应力差的变化趋于稳定,则试件唯象与材料实际的应力-应变曲线差异较小。计算了不同波动区间内试件的最大应力偏离值及其变化趋势和对应的无量纲时间,研究了入射波是双线性组合波时试件的应力-应变曲线。研究表明:双线性波入射时,2个线性区间可以独立分析,无论如何组合线性区间或应力差如何变化,只要试件两端应力差为近似恒定曲线,对应的试件唯象工程应力-应变曲线都是相对准确的。

眼镜镜片尖边轮廓的五轴数控加工

为了改善和优化眼镜镜片的加工流程,避免镜片尖边加工过程中刀轴矢量变化剧烈、影响工件表面的加工质量,提出了一种基于UG NX的五轴数控加工路径。利用智能镜框扫描仪对镜框边缘进行扫描,获得镜框凹槽点云数据文件,编写相应程序对符合眼镜片加工标准的OMA文件中的球坐标数据进行坐标及格式转换等处理。基于NURBS曲线拟合算法,实现刀路轨迹的连续性并保证拟合曲线的精度。设计和建立一种控制刀轴矢量平滑变化的刀轴驱动约束方法,依靠曲线驱动刀轴及镜片曲面法向量约束刀轴使刀头平滑进给,并将刀轨文件经过后处理转换为NC文件。最后,对加工后的镜片进行误差测量,结果表明,通过点云数据拟合刀路曲线的方法提高了加工面的精确度和光滑性,有效缩减了加工流程,提高了加工效率。