基于能量法光顺的四次自由曲线拼接算法

针对AutoCAD及CAXA等软件的自由曲线造型中,需绘制的曲线跟着鼠标移动时会发生闪烁,严重时会出现死机现象这一缺陷,该文依据了有关能量法光顺的原理,采用了分段拼接曲线的思想,选取了四次样条函数的曲线方程。经仔细推算并编程实验证明:本算法涉及的数据量少,曲线拼接速度快,效果好。由于采用的是四次样条曲线,故其光顺性的取法更好且合理,同时,该算法在CAD上能直接应用。     

NURBS曲面多分辨率光顺拼接及其在复杂产品变形设计中的应用

针对复杂产品变形设计中曲面拼接问题,提出基于小波基多尺度分解的NURBS曲面多分辨率光顺拼接与融合方法.首先根据小波分析的多分辨率理论将样条曲面分解为相互正交的两部分,其中低频粗样条函数表示光顺曲面,高频曲面细节函数表示曲面噪声部分;然后利用曲面曲率特征,在B样条小波基多水平分解过程中光顺处理曲面;最后通过设定适当的阈值过滤曲面噪声部分,重构光顺曲面.实验结果表明,文中方法既能保证拼接曲面的几何连续性,又增强了曲面外形的整体光顺性.     

异度隐函数样条曲线曲面

隐式曲线曲面被广泛应用于曲线曲面插值、逼近与拼接. 通过添加辅助曲线曲面,提出异度隐函数样条曲线曲面方法,并对其插值性、凸性与正则性进行分析. 具体实例表明,异度隐函数样条提供了次数低、构造简单、灵活性好的曲线曲面插值与拼接方法.     

C-B样条曲线的分割和拼接

曲线曲面造型中设计复杂的自由曲线时,单段曲线已不能满足外形设计的要求,因而在实际造型中,经常采用曲线的分割和拼接。C-B样条理论是曲线曲面造型的一项重要内容。在对C-B样条基函数及曲线端点特性分析的基础上,提出了C-B样条曲线的任意分割算法,并对C-B样条曲线间进行了G1拼接,给出了B样条曲线和C-B样条曲线G1和G2光滑拼接的几何条件。采用分割和拼接技术会增加C-B样条曲线的灵活性,所得结论具有明确的几何意义,并可以进一步推广到C-B样条曲面造型中。     

一种基于G~1拼接技术的曲面造型新方法

C-B样条曲线不能精确表示半圆弧和半椭圆弧。本文讨论了C-B样条曲线和有理三次Bézier曲线的端点性质,在对C-B样条曲线和有理三次Bézier曲线端点特性分析的基础上,通过增加控制顶点使C-B样条曲线通过控制多边形的首末顶点并与首末边相切,给出了C-B样条曲线和有理三次Bzier曲线间G1拼接条件,利用有理三次Bézier曲线能够精确表示半圆弧的特点,与C-B样条曲线进行G1拼接,从而较好地解决了C-B样条曲面造型中圆弧和半圆弧的表示问题,有效地增强了C-B样条方法控制及表达曲线的能力。     

二元三次样条曲面的C1光滑拼接

在一元三次样条曲线的基础上,提出了二元三次样条曲面的构造,可对多块曲面片作Ｃ１光滑拼接,用于各种工业外形的造型设计。     

二元三次样条曲面的C1光滑拼接

在一元三次样条曲线的基础上,提出了二元三次样条曲面的构造,可对多块曲面片作C1光滑拼接,用于各种工业外形的造型设计。     

三次均匀有理B样条曲线的权因子优化光顺算法

给出了一种使三次均匀有理Ｂ样条曲线光顺的权因子优化算法，通过优化计算，得到了光顺曲线的权因子。本文采用了非线性优化技术光顺曲线的权因子。     

均匀T-B样条曲线的研究

在对均匀T-B样条基函数及其曲线端点特性分析的基础上提出了n次均匀T-B样条基函数的表达式,通过重新参数化使其参数区间范围规范为[0,1]。给出了均匀T-B样条曲线的升阶公式、控制点反求公式以及均匀T-B样条曲线与T-Bézier曲线间G1/C1拼接的条件,所得结论具有明确造型意义,能较好地应用于曲线曲面造型系统中。     

C-曲线间G1拼接条件及在曲面造型中的应用

C-B样条无法精确表示半圆弧和半椭圆弧,在对C-B样条曲线和C-Bézier曲线基函数及端点特性分析的基础上,通过增加控制顶点使C-B样条曲线通过控制多边形的首末顶点并与首末边相切,给出了C-B样条曲线和C-Bézier曲线间G1拼接条件;利用C-Bézier曲线表示半圆弧和半椭圆弧,并与C-B样条曲线进行G1拼接,从而解决了C-B样条曲面造型中半圆弧和半椭圆弧的表示问题。     

A shape controled fitting method for Bézier curves

The problem of controling a shape when fitting a curve to a set of digitized data points by proceeding to a least squares approximation is considered. A nonlinear method of solving this problem, dedicated to the obtention of planar curves with a smooth and monotonous variation of curvature is introduced. This method uses particular Bézier curves, called typical curves, whose control polygon is partially constrained in order to provide the desired curve shape. The curve fitting principle is based on variations of the tangent direction at the ends of the curve. These variations are controled by the displacement of a given curve point. An automatic procedure using this method to get a curve close to a set of data points has been implemented. An application to car body shape design and a comparison with the least squares approximation method is presented and discussed.     

Partial Lifting and the Elliptic Curve Discrete Logarithm Problem

It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from elliptic curves over finite fields to global fields. We explore the possibility of circumventing the problem of explicitly lifting points by investigating whether partial information about the lifting would be sufficient for solving the elliptic curve discrete logarithm problem. Along this line, we show that the elliptic curve discrete logarithm problem can be reduced to three partial lifting problems. Our reductions run in random polynomial time assuming certain conjectures, which are based on some well-known and widely accepted conjectures concerning the expected ranks of elliptic curves over the rationals. Should the elliptic curve discrete logarithm problem admit no subexponential time attack, then our results suggest that gaining partial information about lifting would be at least as hard.     

Approximate merging of B-spline curves via knot adjustment and constrained optimization

This paper addresses the problem of approximate merging of two adjacent B-spline curves into one B-spline curve. The basic idea of the approach is to find the conditions for precise merging of two B-spline curves, and perturb the control points of the curves by constrained optimization subject to satisfying these conditions. To obtain a merged curve without superfluous knots, we present a new knot adjustment algorithm for adjusting the end k knots of a kth order B-spline curve without changing its shape. The more general problem of merging curves to pass through some target points is also discussed.     

有理Bézier曲线的区间近似合并

为压缩几何信息的数据量,将区间曲线分解成中心曲线和误差曲线的形式,从而得到能够包含2条相邻有理Bézier曲线的区间近似合并曲线.该算法利用摄动误差最小化,通过求解一个线性方程组得到作为中心曲线的近似合并曲线;再利用中间结果直接得到区间宽度相等的误差曲线,或者通过二次规划得到逼近效果更佳但是等区间宽度不等的误差曲线;如果令端点处的区间宽度为0,还能得到端点插值的区间近似合并曲线;最后通过实例验证了文中算法的有效性.     

Curvature-based blending of closed planar curves

A common way of blending between two planar curves is to linearly interpolate their signed curvature functions and to reconstruct the intermediate curve from the interpolated curvature values. But if both input curves are closed, this strategy can lead to open intermediate curves. We present a new algorithm for solving this problem, which finds the closed curve whose curvature is closest to the interpolated values. Our method relies on the definition of a suitable metric for measuring the distance between two planar curves and an appropriate discretization of the signed curvature functions.     

Fitting Related Sets of Straight-line Data

Abstract

Many physical experiments give rise to sets of curves related by the requirement that, although certain of the curve parameters may vary from curve to curve, others should be the same for all of the curves. To get the “best” values of the common parameters, one would like to fit all of the curves simultaneously by the appropriate theoretical expressions. This paper deals with this problem, presenting an algorithm for its solution, in the case that the curves are straight lines with common slope and “best” fit is defined in the uniform (or minimax) sense.     

圆域B样条曲线的节点去除

在圆域算术的基础上,引入了圆域B样条曲线的概念,并讨论了它的一些基本性质.研究了圆域B样条曲线的节点去除问题,即用去除一个节点后的圆域B样条曲线包住原曲线,采用拟线性规划和最佳逼近2种方法,分别给出了该问题的解析解.     

增量极坐标编码的贝赛尔曲线智能优化算法

针对基于统计的隶属度函数确定方法进行了改进,使用贝塞尔曲线作为隶属度函数的上升或下降沿,使隶属度函数可以经过统计结果规定的任意中间点。使用新的增量极坐标编码对贝塞尔曲线控制点进行表达,解决了传统贝塞尔曲线优化中的控制点约束问题。采用差分进化算法对贝塞尔曲线控制点进行优化,可智能拟合经过任意点的最佳贝塞尔曲线。算法可扩展到任意阶贝塞尔曲线,所得隶属度函数较非贝塞尔曲线方法更为合理。     

有理四次插值样条曲线的区域控制

将插值曲线约束于给定的区域之内是曲线形状控制中的重要问题.构造了一种分母为线性的C1连续有理四次插值样条.该有理四次插值样条中含有参数和调节参数,因而可以在插值条件不变的情况下通过对参数的选择进行曲线的局部修改,给约束控制带来了方便,同时可以通过对参数的控制实现C2连续的插值.对该种插值曲线的区域控制问题进行了研究,给出了将其约束于给定的折线、二次曲线之上、之下或之间的充分条件.最后给出了数值例子.     

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

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