三参数binary细分法

通过在曲线细分过程中引入三个参数,给出一种新的细分曲线构造的算法,并利用生成多项式等方法对细分法的一致收敛性、Ck连续性进行了分析.在给定初始控制数据的条件下,可以通过对形状参数的适当选择来实现对细分极限曲线形状的调控.该方法可以生成C4连续的细分曲线,增加了曲线造型的灵活性.数值试验表明这种算法是有效的.     

Lupaşq-Bézier曲线的几何求值算法及其应用

Lupaş q-Bézier 曲线是一种以 q-整数作为形状参数的广义 Bézier 曲线。本文构造了 Lupaş q-Bézier 曲线的一种新型几何求值算法,该算法倒数第二层 2 个节点的仿射组合与曲线相切。利用算法的相切性质得到 Lupaş q-Bézier 曲线导矢的一种新表示,并实现了 Lupaş q-Bézier 曲线的细分。特别地,二次 Lupaş q-Bézier 曲线 分割得到的 2 条子曲线的形状参数的乘积等于原曲线的形状参数。进一步,得到了加权 Lupaş q-Bézier 曲线的一 种新型几何求值算法,该算法具有显式矩阵表示。     

基于参数分解的正则四边形插值细分曲面的快速求值

提出了两种正则四边形网格插值细分曲面的求值算法.算法基于参数m-进制分解和构造矩阵序列,通过参数分解数列对应的矩阵乘积得到基函数值,得到初始网格上对应控制点的权值,从而实现插值细分曲面求值.算法1 基于2D 细分掩模,算法2 基于张量积.数值实验表明,算法高效且低存储.     

四点多参数Binary细分曲线

在曲线细分过程中引入六个参数,构造出一种新的四点多参数细分Binary曲线算法。对四点多参数Binary细分法的一致收敛性、连续性进行分析,该算法使Dyn四点法以及2到6次均匀B样条细分曲线成为特例。通过对形状参数的适当选择来实现对细分极限曲线形状的调控,增加曲线造型的灵活性,并给出造型实例。     

Bézier曲线细分收敛定理的推广

在CAGD中,基于de Casteljau算法对Bézier曲线进行迭代细分时收敛定理成立,即假设每一次在相同的位置参数r(0＜r＜1)处对曲线进行细分,那么迭代得到的控制多边形收敛到初始控制多边形定义的Bézier曲线.文中对这一定理进行推广,给出了允许在每一次细分时采用不同的位置参数,得到了细分后产生的控制多边形收敛到初始控制多边形所定义的Bézier曲线的充要条件,并讨论了收敛速度.     

一种三次非均匀B样条曲线的细分算法

近几年来,以B样条曲线为代表的曲线细分已成为计算机图形学领域的一项重要研究内容。提出一种基于对分方式的细分算法,能均匀地细分曲线,并用较少的细分次数得到对曲线较好的逼近效果。采用该细分算法,方便而快速地在计算机上绘制B样条曲线,对给定参数做出更加优良的控制动作,并提高控制系统的运动速度和曲线的显示速度,实例表明了该算法的有效性。     

混合细分曲线及其应用

构造了2个混合细分模式,一个是基于三次B样条细分的二分混合细分曲线族;另一个是基于一种三分三点逼近细分的三分混合细分曲线族.通过调整混合参数来控制曲线的收缩与膨胀幅度,利用生成函数技术和特征值方法对这2个带参数的细分模式的连续性进行了严格的理论分析.最后,通过选择合适的混合参数给出了一种曲线保长的动态细分方法.     

一次复有理Bézier曲线的最优参数化

为了更加方便清晰地应用复形式的有理deCasteljau算法和细分算法,通过研究一次复有理Bézier曲线的最优参数化问题,提出2种最优参数化方法——代数方法和几何方法.代数方法借助直接的代数运算推导曲线在Mbius变换下的重新参数化,使得这种参数化在L2范数下最接近于弧长参数化;而几何方法从一次复有理Bézier曲线的内在几何性质出发,直接求得曲线在Mbius变换下的最优参数化,进而揭示曲线最优参数化的本质.另外,从应用角度给出了用一次复有理Bézier曲线插值3个给定点的公式.实验结果表明,在最优参数化后,曲线上的等参数点分布更加均匀,因而拥有更强的实用性.     

曲面三参数binary细分法

在经典四点细分法的基础上,通过在曲线细分过程中引入三个参数,给出一种改进的细分曲线构造的算法,利用生成多项式等方法对细分法的一致收敛性、Ck连续性进行了分析。并把该方法扩展到曲面上,进而提出了曲面三参数binary细分法。在给定初始控制数据的条件下,可以通过对形状参数的适当选择来实现对细分极限曲面形状的调控。数值实验表明该算法较容易控制曲面形状,可方便地应用于工程实际,解决曲线、曲面位置调整和控制问题。     

Lupa?q-Bézier曲线的显式递归生成

为了得到具有更好性质的Lupa?q-Bézier曲线的递归求值算法,通过应用Pascal-type关系和重新参数化,构造具有显式矩阵表示的de Casteljau算法,并得到具有对称性质的Lupa?q-Bézier曲线.首先,利用Pascal-type关系构造具有显式矩阵表示的de Casteljau算法,该算法具有经典Bézier曲线的de Casteljau算法的3个性质;然后,通过重新参数化调整Lupa?q-Bézier曲线上点的分布,得到具有对称性质的Lupa?q-Bernstein基函数和Lupa?q-Bézier曲线,给出重新参数化后Lupa?q-Bézier曲线的一种矩阵累乘的递归生成方法.另外,从应用角度给出了用一条Lupa?q-Bézier曲线逼近2条光滑拼接的Bézier曲线的数值实例,进而验证了文中算法的有效性.     

Wang-Ball曲线的细分算法及包络

利用Wang-Ball基函数的对偶基给出用显式表示的Wang-Ball曲线的细分算法(细分矩阵),导出幂基函数在Wang-Ball基下的Marsden恒等式,作为其应用还给出了几个相关的组合恒等式．由Wang-Ball基与Barnstein基之间的转换公式构造了Wang-Ball曲线的包络     

Calculation of dimensions of curves generated by subdivision schemes

Little attention has been paid to estimating dimensions of the curves generated by the subdivision algorithms. A unified method is proposed to estimate the dimension of curves generated by the arbitrary, stationary, linear subdivision schemes with given control points, based on a theorem about the Hausdorff dimension of iterated function systems. Several examples are given to demonstrate the implementation of the method, including the Koch curve, the uniform quadratic B-spline curve and the curves generated by the four-point binary and ternary interpolatory subdivision schemes with a free parameter. Compared with the method of the traditional iterated function system collage theorem, our algorithm overcomes the disadvantage of choosing points and collage, avoiding a large amount of calculation to find the contractive affine transformations and the contraction constants. Furthermore, we can calculate not only the dimension of the special curves with the geometric structure of self-similarity, but also the dimension of the curves generated by more general subdivision algorithms.     

A subdivision scheme for Poisson curves and surfaces

The de Casteljau evaluation algorithm applied to a finite sequence of control points defines a Bézier curve. This evaluation procedure also generates a subdivision algorithm and the limit of the subdivision process is this same Bézier curve. Extending the de Casteljau subdivision algorithm to an infinite sequence of control points defines a new family of curves. Here, limits of this stationary non-uniform subdivision process are shown to be equivalent to curves whose control points are the original data points and whose blending functions are given by the Poisson distribution. Thus this approach generalizes standard subdivision techniques from polynomials to arbitrary analytic functions. Extensions of this new subdivision scheme from curves to tensor product surfaces are also discussed.     

Algebraic pruning: a fast technique for curve and surface intersection

Computing the intersection of parametric and algebraic curves and surfaces is a fundamental problem in computer graphics and geometric modeling. This problem has been extensively studied in the literature and different techniques based on subdivision, interval analysis and algebraic formulation are known. For low degree curves and surfaces algebraic methods are considered to be the fastest, whereas techniques based on subdivision and Bézier clipping perform better for higher degree intersections. In this paper, we introduce a new technique of algebraic pruning based on the algebraic approaches and eigenvalue formulation of the problem. The resulting algorithm corresponds to computing only selected eigenvalues in the domain of intersection. This is based on matrix formulation of the intersection problem, power iterations and geometric properties of Bézier curves and surfaces. The algorithm prunes the domain and converges to the solutions rapidly. It has been applied to intersection of parametric and algebraic curves, ray tracing and curve-surface intersections. The resulting algorithm compares favorably with earlier methods in terms of performance and accuracy.     

一种n次均匀B样条曲线细分算法

利用 次均匀B样条细分的掩模与Pascal三角形关系,并借助控制多边形在每次加细过程中新旧控制顶点对应的几何位置关系,给出一种新的 次均匀B样条曲线细分算法,基于该算法构造出带有形状参数的局部插值约束的奇次均匀B样条细分曲线。通过理论和算例说明,该算法几何直观性强、新旧点对应明确、应用灵活且能保持良好的参数连续性。     

NURBS细分曲线算法

从基于差商算子定义B样条的角度,在对B样条基函数进行细分基础上提出了一种NURBS细分曲线算法,应用在自由型曲线生成和形状控制上具有良好的实际效果,完全具备了参数NURBS曲线的重要性质。最后给出了细分曲线生成圆及圆弧的实例。     

A new subdivision based approach for piecewise smooth approximation of 3D polygonal curves

This paper presents an algorithm dealing with the data reduction and the approximation of 3D polygonal curves. Our method is able to approximate efficiently a set of straight 3D segments or points with a piecewise smooth subdivision curve, in a near optimal way in terms of control point number. Our algorithm is a generalization for subdivision rules, including sharp vertex processing, of the Active B-Spline Curve developed by Pottmann et al. We have also developed a theoretically demonstrated approach, analysing curvature properties of B-Splines, which computes a near optimal evaluation of the initial number and positions of control points. Moreover, our original Active Footpoint Parameterization method prevents wrong matching problems occurring particularly for self-intersecting curves. Thus, the stability of the algorithm is highly increased. Our method was tested on different sets of curves and gives satisfying results regarding to approximation error, convergence speed and compression rate. This method is in line with a larger 3D CAD object compression scheme by piecewise subdivision surface approximation. The objective is to fit a subdivision surface on a target patch by first fitting its boundary with a subdivision curve whose control polygon will represent the boundary of the surface control polyhedron.     

Detection of loops and singularities of surface intersections

Two surface patches intersecting each other generally at a set of points (singularities), form open curves or closed loops. While open curves are easily located by following the boundary curves of the two patches, closed loops and singularities pose a robustness challenge since such points or loops can easily be missed by any subdivision or marching-based intersection algorithms, especially when the intersecting patches are flat and ill-positioned. This paper presents a topological method to detect the existence of closed loops or singularities when two flat surface patches intersect each other. The algorithm is based on an oriented distance function defined between two intersecting surfaces. The distance function is evaluated in a vector field to identify the existence of singular points of the distance function since these singular points indicate possible existence of closed intersection loops. The algorithm detects the existence rather than the absence of closed loops and singularities. This algorithm requires general C² parametric surfaces.     

A subdivision algorithm for generalized Bernstein–Bézier curves

In this article we present a computationally efficient subdivision algorithm for the evaluation of generalized Bernstein–Bézier curves. As particular cases we have subdivision algorithms for classical as well as trigonometric Bernstein–Bézier curves.