利用弦长参数插值拟合光滑闭合B样条曲线构造方法

文章针对非均匀采样点拟合光滑B样条曲线构造问题,提出一种基于已知控制点和相邻控制点之间弦长求解控制点方程组系数矩阵来构造光滑B样条曲线的方法。该方法通过控制顶点所在曲线的光顺性提高最终生成曲线的连续性和光滑性。在此基础上,设计了闭合B样条曲线控制点的快速求解算法。首先利用所有控制顶点和相邻点间弦长建立求解系数的参数矩阵,再提出一种基于LU矩阵分解的优化算法。根据方程组系数矩阵的特点,参照追赶法的LU分解,构造了分解后的L、U矩阵结构。最后通过实例说明,采用文中方法所构造的B样条曲线具有较好的光滑性,也证明了该算法的可靠性和有效性。     

一种基于矩阵LU分解的分段B样条插值法

采用分段三次b样条曲线来光滑地连接采样点，满足了连续性要求；由于分段b样条插值控制点形成三对角线性方程组，通过矩阵的LU分解来求解该控制点方程组，实验结果表明，该方法快速地生成了通过所有采样点的光滑连续自由曲线，完全可以达到实时任务的要求。     

任意控制点的三维三次B样条曲线绘制系统

为了使B样条曲线得到更广泛应用和方便《计算机辅助几何设计》课程关于B样条曲线的可视化教学。用Matlab GUI编程设计了＂三维空间的三次B样条曲线绘制系统＂。此系统界面简洁,使用方便。可用键盘输入任意个控制点,也可用文件方式输入任意个控制点;用矩阵描述三维空间的三次B样条曲线方程,实现了快速计算并绘制出光滑的三次B样条曲线。     

任意个控制点的三次B样条曲线绘制系统设计

三次B样条曲线在实际工程中得到了广泛应用,在目前的文献中还未查到任意个控制点的三次B样条曲线绘制系统。为了使B样条曲线得到更广泛应用和方便《计算机辅助几何设计》课程关于B样条曲线的可视化教学,本文用MatlabGUI编程设计三次B样条曲线绘制系统。此系统界面简洁,使用方便。可用鼠标在屏幕坐标系上点击输入任意个控制点,也可用文件方式输入任意个控制点。用矩阵描述B样条曲线方程,实现快速计算并绘制出光滑的三次B样条曲线。     

基于曲率优化的机器人砂带磨削轨迹规划

针对复杂曲面零件砂带磨削编程效率低、精度差的问题,基于B样条曲线曲面重构和机器人离线编程技术,提出了一种根据关键接触点曲率值生成工业机器人磨削轨迹的方法.首先,利用零件表面上需要进行砂带磨削的关键接触点和积累弦长参数化法构造节点矢量,从而计算出磨削轨迹的B样条基函数;其次,根据控制顶点反求矩阵得到全部未知控制点和3次B样条加工曲线;然后,分析关键接触点之间的曲率变化率和弧长,对关键点细化生成符合磨削工艺要求的目标点;最后,通过求解双3次B样条插值曲面方程获得目标点的加工姿态.以水龙头磨削为例进行试验,结果表明曲率优化算法磨削的零件表面轮廓形状明显优于截面法,且其粗糙度值能稳定在0.082 μm左右,可以有效提高工件表面加工质量.     

混合插值法重构近地表模型

当控制点多和网格稠密时,基于薄板样条(TPS)插值的近地表模型重构往往很耗时,影响了静校正中近地表建模的效率.针对此问题,采用一种TPS插值和三次样条插值相结合的混合插值法重构近地表模型.首先利用矩阵递归LU分解及GPU加速的LU分解算法求解大型线性方程组,建立TPS插值函数;然后在X和Y方向上使用适当的步长对网格进行抽稀,运用TPS插值函数计算稀疏网格点的值,再通过稀疏网格点建立三次样条插值函数并计算剩余网格点的值;最后用OpenGL实现近地表模型的三维可视化.实验结果表明,文中算法提高了近地表模型重构的速度,其精度接近TPS插值精度.     

四元数样条插值的人体运动数据重构

为了得到平滑的人体动画,提出一种基于四元数的样条插值算法,利用提取的关键帧实现人体运动序列的有效重构。为减少重构误差、加快收敛速度,将已知关键帧集合作为初始条件,通过迭代算法求出样条曲线的控制点集合。利用样条曲线控制点计算贝塞尔曲线控制点,构造贝塞尔样条曲线段,将各段贝塞尔样条曲线段组合,构造一条基于四元数的样条曲线。根据德卡斯特里奥（de Casteljau）算法插值重构人体运动。实验结果表明,该算法在保证执行效率的同时,可得到光滑的插值结果,实现满足视觉要求的人体运动重构。     

基于非均匀B样条的船体型线设计软件的研究与应用

文章主要通过对船舶型线设计和非均匀B样条特性的研究,结合船舶型线设计软件,提出了非均匀B样条在船舶型线设计中的应用方法和原理,并提供了必要的数学证明。首先,讨论了利用曲线的分段连接点与控制点或控制多边形的边对应关系,确定非均匀B样条节点矢量的方法,从而解决了用非均匀B样条生成型线的先决问题;其次,提出了K次非均匀B样条曲线的节点插值方法,并讨论了在非封闭曲线和封闭曲线条件下如何反算样条曲线控制点的数学方法;然后,提出了r阶非均匀B样条的导矢算法;最后提出了国内船舶型线辅助设计软件有待进一步研究和发展的一些看法。     

基于约束优化的B样条曲线形状修改

B样条曲线广泛应用于计算机辅助几何设计(CAGD),并且与Bézier曲线等其它著名曲线相比,在形状设计方面有其更独特的性质。对曲线的设计和形状的修改是一个重要的课题,也是计算机图形学、CAD/CAM和数控技术领域最重要的研究主题之一。论文运用约束优化的方法,修改均匀B-样条的控制点,使B样条曲线通过调整的控制点,使修改前后曲线的距离范数达到最小,并给出相应的实例说明算法的有效性。     

基于广义逆节点消去的B样条曲线的可控逼近

提出了一个基于节点消去的B样条曲线的逼近算法。该算法首先从插值于给定数据点的一阶B样条曲线出发,利用广义逆矩阵实现节点消去,并通过升阶、最小二乘逼近和投影修正误差等步骤,得到了与给定数据点的误差在容许范围内的逼近曲线。     

An efficient implementation of LU decomposition in C

An implementation of the well-known LU decomposition method for solving systems of linear equations is presented. Operation counts typically stated for this method are derived from a theoretical analysis of the algorithm and ignore the practical aspects of the implementation. The overhead associated with assessing elements of the two-dimensional coefficient array are explored herein, and seen to be substantial. This overhead is incorporated into the analysis of LU decomposition and new operation counts are developed. By exploiting the addressing capabilities of C the cost of array access is significantly reduced, resulting in an efficient implementation. The techniques employed here can be applied to a wide variety of C programs which utilize multi-dimensional arrays.     

A real structure-preserving method for the quaternion LU decomposition,revisited

In a paper published in 2013, Wang and Ma proposed a structure-preserving algorithm for computing the quaternion LU decomposition. They claimed that it was faster than the LU decomposition implemented in the quaternion Toolbox for Matlab (QTFM). But in 2015, Sangwine, one of the authors of QTFM, pointed out that the tests carried out by him did not support Wang and Ma’s claim. We studied the structure-preserving algorithm of Wang and Ma, and found that the computations were based on element to element operations. In this paper, we re-propose real structure-preserving methods for the quaternion LU decomposition and partial pivoting quaternion LU decomposition, which make full use of high-level operations, and relation of operations between quaternion matrices and their real representation matrices. These algorithms are more efficient than that in QTFM using quaternion arithmetics. Numerical experiments are provided to demonstrate the efficiency of the real structure-preserving method.     

基于Delaunay三角网的等值线绘制算法*

提出了一种快速构建Delaunay三角网算法（QGDTN）。在每次迭代中,该算法从点集P最左边的两点中,选取离凸边中点距离最近的一点与凸边构成Delaunay三角形,并加入三角网中,算法实现简单,且时间复杂度为O(n)。基于Delaunay三角网,根据三角形的各边上是否有等值点,用内插值法求出等值点坐标,跟踪、连接等值点生成等值线;最后,采用三次方Bezier曲线平滑等值线。实验证明,基于Delaunay三角网的等值线绘制算法是高效的,并且具有一定的实用价值。     

基于LU分解和交替最小二乘法的分布式奇异值分解推荐算法

针对当前分布式潜在因子推荐算法存在时间复杂度较高、运行时间较长的问题,文中提出基于LU分解和交替最小二乘法(ALS)的分布式奇异值分解推荐算法,利用ALS利于分布式求解目标函数的特点,提出网格状分布式粒度分割策略,获取相互独立不相关的特征向量.在更新特征矩阵时,使用LU分解求逆矩阵,加快算法的运行速度.在KDD CUP 2012 Track1中的腾讯微博数据集上的实验表明,文中算法在确保一定推荐精度的前提下,大幅提升推荐速度和算法效率.     

新预处理ILUCG法求解稀疏病态线性方程组

大型稀疏病态线性方程组的高效求解在科学计算和工程应用中起着十分重要的作用.对于一般非对称正定的非奇异线性代数方程组,首先介绍常用的不完全LU分解预处理矩阵构造技术;然后给出SSOR预处理分解及其改进分解,并基于ILUCG思想提出新预处理ILUCG法同时给出收敛性分析;最后进行数值模拟仿真试验,数值结果表明该算法是有效可行的,且较之一般的预处理ILUCG方法该法在求解稀疏病态方程组方面具有优越性.     

An augmented Lagrangian decomposition method for quasi-separable problems in MDO

Several decomposition methods have been proposed for the distributed optimal design of quasi-separable problems encountered in Multidisciplinary Design Optimization (MDO). Some of these methods are known to have numerical convergence difficulties that can be explained theoretically. We propose a new decomposition algorithm for quasi-separable MDO problems. In particular, we propose a decomposed problem formulation based on the augmented Lagrangian penalty function and the block coordinate descent algorithm. The proposed solution algorithm consists of inner and outer loops. In the outer loop, the augmented Lagrangian penalty parameters are updated. In the inner loop, our method alternates between solving an optimization master problem and solving disciplinary optimization subproblems. The coordinating master problem can be solved analytically; the disciplinary subproblems can be solved using commonly available gradient-based optimization algorithms. The augmented Lagrangian decomposition method is derived such that existing proofs can be used to show convergence of the decomposition algorithm to Karush–Kuhn–Tucker points of the original problem under mild assumptions. We investigate the numerical performance of the proposed method on two example problems.     

Degree reduction of Bézier curves with restricted control points area

In this paper, we propose a new approach to the problem of degree reduction of Bézier curves with respect to the least squares norm. We impose restrictions of the control points area to get more intuitive location of the control points. As a result, the degree reduced curve is suitable for further modification and applications. We present and compare two methods of solving the new problem. First one is based on quadratic programming approach and the other on BVLS algorithm. Some illustrative examples are given.     

Parallel quadrant interlocking factorization on hypercube computers

In this article we present an adaptation of the QIF (Quadrant Interlocking Factorization) algorithm, which solves systems of linear equations, for implementation in SIMD hypercube computers with distributed memory. This method is based in the WZ decomposition of the system's matrix. The parallel algorithm developed is general in the sense that there is no restriction imposed on the size of the problem and that it is independent of the dimension of the hypercube. The comparison of this algorithm with the parallel algorithms based on the LU factorization show that the execution time is divided by a factor of two, approximately.     

DFP优化的数据点渐进迭代拟合方法

DFP方法(由Davidon,Fletcher和Powell 3人共同提出)是求解无约束优化问题的一种经典方法,文中指出数据点的拟合问题可转化为无约束优化问题的求解,并基于DFP优化方法给出了一种大规模数据点拟合方法,称之为DFP渐进迭代拟合方法.文中证明了该方法生成的极限曲线为初始数据点的最小二乘拟合曲线;它承袭了经典最小二乘渐进迭代逼近算法的众多优良性质,如具备直观的几何意义、可灵活地拟合大规模数据点、初始控制顶点的选择不影响最终迭代结果等.数值实例进一步表明,同等条件下,文中方法的收敛速度明显优于现有的几种数据点拟合方法.