四边形网格的去边细分方法

提出一种四边形网格细分算法：每细分一次四边形网格，其数目增加为原来的两倍，细分二次结果相当于一次二分细分和一个旋转．该算法采用三次B样条张量积的形式，其生成曲面在规则点具有C^2连续性，在非规则点具有C^1连续性．由于该细分算法对网格几何操作简单，所得网格数据量增长相对缓慢，适合于3D图像重构及网络传输等应用领域。     

带形状参数的二次B样条曲线

提出一种带形状参数的二次B样条曲线，这种曲线对非均匀节点为C^1-连续，对于均匀节点且当所有参数都等于1时为C^2-连续．与不带形状参数的二次B样条曲线相比，其形状既能整体变化又能局部变化，并且能从两侧逼近控制多边形．此外，毋需采用重节点技术或解方程组就能直接插值控制点或控制边．     

高阶连续的形状可调三角多项式曲线曲面

目的目前使用的B样条曲线曲面存在着高连续阶与高局部调整性两者无法兼而有之的不足,且B样条曲线曲面的形状被控制顶点和节点向量唯一确定,这些因素影响着B样条方法的几何设计效果与方便性。本文旨在克服这种局限,以期构造具有高次B样条方法的高连续阶,低次B样条方法的高局部调整性,以及有理B样条方法权因子决定的形状调整性的曲线曲面。方法在三角函数空间上构造了一组含参数的调配函数,进而定义具有与3次B样条曲线曲面相同结构的新曲线与张量积曲面。结果新曲线曲面继承了B样条方法的凸包性、对称性、几何不变性等诸多性质。不同的是,同样是基于4点分段,3次均匀B样条曲线C2连续,而对于等距节点,在一般情况下,新曲线C5连续,当参数取特殊值时可达C7连续。新曲线在C5连续的情况下存在1个形状参数,能较好地调整曲线的形状同时又无须改变控制顶点。另外,将形状参数设为特定值,新曲线可以自动插值给定点列。新曲面具有与新曲线相应的优点。结论在强局部性下实现高阶连续性的形状可调分段组合曲线曲面,为高阶光滑曲线曲面的设计提供了可能,并且新曲线实现了逼近与插值的统一表示,能较好地应用于工程实际。调配函数的构造方法具有一般性,可用相同方式构造其他具有类似性质的调配函数。     

误差可控的近似B样条曲面蒙皮算法

B样条曲面蒙皮是曲面造型中常用的一种造型方式,传统的蒙皮算法会导致最终的蒙皮曲面含有大量的控制点.在Piegl算法的基础上,提出一种更加高效且误差可控的近似蒙皮算法.对B样条基函数的最大值进行了更为精确的估计,并且充分利用B样条基函数的局部支撑性,尽可能多地删除相容性处理后B样条曲线的控制点,使得蒙皮算法更加有效.实验结果表明,在同样的误差范围内,文中算法可以比Piegl算法减少更多的控制点.     

基于法矢控制的B样条曲面逼近的PIA方法

提出了一种基于法矢控制的 B 样条曲面逼近的渐进迭代逼近(PIA)算法。一方面该方法将离散数据点的切失、曲率、法矢等几何特征充分应用到离散数据点的逼近问题上,利用数据点两个方向的切矢构造出数据点的法矢约束来控制逼近曲面形状,相比于无法矢控制的 B 样条曲面逼近的渐进迭代逼近(PIA)方法,逼近曲面更光顺,可获得更好的逼近效果。另一方面由于该算法选取主特征点作为控制顶点,所以允许在曲面拟合中控制顶点的数目小于数据点的数目。而且PIA算法的每次迭代过程中的各个步骤都是独立的,很容易被应用到并行计算上,可提高计算效率。本文还给出了一些实例来验证该算法的有效性。     

三次B样条曲线骨架卷积曲面造型

提出一种基于B样条曲线降阶的三次B样条曲线骨架卷积曲面造型方法．首先通过顶点扰动降阶方法把三次B样条曲线骨架（C^1连续）降阶为C^1连续的二次B样条，然后应用二次B样条曲线骨架的卷积曲面势函数计算方法得到三次B样条曲线骨架的势函数．     

局部调整插值点的三次样条曲线表示

给出了带局部形状参数的三次样条曲线生成方法．所给方法以Hermite型插值曲线和非均匀三次B样条曲线为特殊情形，将插值于控制点的曲线和逼近于控制多边形的非均匀B样条曲线统一起来．一个形状参数只影响两条曲线段，曲线表达式保持了三次Bezier曲线表达式的简单结构．改变形状参数的值或调整Bezier控制点，可以局部调整曲线的形状．基于所给样条曲线，给出了带局部形状参数的双三次样条曲面．     

一种带形状参数的三角样条曲线

本文针对三次B样条曲线相对于其控制多边形形状固定,不能描述除抛物线以外的圆锥曲线的不足进行改进。将形状参数与三角函数进行有机结合,构造了一组含参数的三角样条基,基于这组基定义了一种结构类似于三次B样条曲线的带形状参数的三角样条曲线。新曲线在继承B样条曲线主要优点的同时,既具有形状可调性,又能精确表示椭圆,而且其连续性和对控制多边形的逼近性也都优于三次B样条曲线。对于等距节点,在一般情况下该曲线整体C3连续,在特殊条件下可达C5连续。利用张量积方法,将曲线推广后所得到的曲面具有与曲线类似的性质,给出了用曲面表示椭球面的方法。     

B样条曲线曲面GC2扩展

提出了一个扩展B样条曲线曲面的新方法，扩展B样条曲线曲面的关键是为新增加的点确定节点值，新方法的基本思想是：首先，B样条曲线和扩展部分在连接点处满足GC^2连续，用能量极小化方法确定扩展部分的曲线形状，通过对曲线重新参数化使两部分曲线满足C^2连续，进而确定新增加点的节点值，新B样条曲线的控制点由一个显式递推公式计算，原B样条曲线和扩展后的部分合在一起形成一条新的B样条曲线，新的B样条曲线满足原B样条曲线和扩展的点，文章还讨论了运用该方法进行B样条曲面扩展，且以实例对新方法与其它方法进行了比较，结果表明新方法的光顺性得到了明显改善，曲率变化更平坦，且有较小的旋转数指标。     

NURBS在几何造型中的应用技巧

本文论述了ＮＵＲＢＳ在几何造型中的使用方法和技巧，介绍了使用ＮＵＲＢＳ精确表示解析实体的简便方法，给出了表示一些特殊曲线、曲面的通用算法．与传统方法［１］［３］相比，减少了控制点数目，容易使用和实现．     

两种带形状参数的曲线

本文构造了两种带参数的三角样条基,基于这两组基定义了两种三角样条曲线。与二次B样条曲线类似,这两种曲线的每一段都由相继的三个控制顶点生成。这两种曲线具有许多与二次B样条曲线类似的性质,但它们的连续性都比二次B样条曲线更好。对于等距节点,在一般情况下,这两种曲线都整体C3连续,在特殊条件下,它们都可达C5连续。两种曲线中的形状参数均有明确的几何意义,参数越大,曲线越靠近控制多边形。另外,当形状参数满足一定条件时,这两种曲线都具有比二次B样条曲线更好的对控制多边形的逼近性。运用张量积方法,将这两种曲线推广后所得到的曲面也具有较好的连续性。     

任意NUBS曲线的小波分析和造型技术

为了对任意NUBS曲线进行精确的分解和重构，提出了半正交B样条小波分解和重构的新算法，同时给出了处理非均匀B样条曲线的非整数阶分辨率的小波分解和重构算法，并实现了任意非均匀B样条曲线的多分辨率表示，对于任意非均匀B样条或NUBS曲线，无论它有多少个控制点，均可以对它进行半正交分解和重构，而不受控制点数必须等于2＋3的限制，从这个意义上讲，该方法不仅可以实现连续分辨率水平（continuous-resolutionlevel)的非均匀B样条曲线造型，还可以对非均匀B样条和NURBS曲线进行精确的分解和重构，这对于B样条曲线曲面的多分辨率造型与显示具有重大应用价值。     

带法向约束的隐式T样条曲线重构

目的 隐式曲线能够描述复杂的几何形状和拓扑结构,而传统的隐式B样条曲线的控制网格需要大量多余的控制点满足拓扑约束。有些情况下,获取的数据点不仅包含坐标信息,还包含相应的法向约束条件。针对这个问题,提出了一种带法向约束的隐式T样条曲线重建算法。方法 结合曲率自适应地调整采样点的疏密,利用二叉树及其细分过程从散乱数据点集构造2维T网格;基于隐式T样条函数提出了一种有效的曲线拟合模型。通过加入偏移数据点和光滑项消除额外零水平集,同时加入法向项减小曲线的法向误差,并依据最优化原理将问题转化为线性方程组求解得到控制系数,从而实现隐式曲线的重构。在误差较大的区域进行T网格局部细分,提高重建隐式曲线的精度。结果 实验在3个数据集上与两种方法进行比较,实验结果表明,本文算法的法向误差显著减小,法向平均误差由10^-3数量级缩小为10^-4数量级,法向最大误差由10^-2数量级缩小为10^-3数量级。在重构曲线质量上,消除了额外零水平集。与隐式B样条控制网格相比,3个数据集的T网格的控制点数量只有B样条网格的55.88%、39.80%和47.06%。结论 本文算法能在保证数据点精度的前提下,有效降低法向误差,消除了额外的零水平集。与隐式B样条曲线相比,本文方法减少了控制系数的数量,提高了运算速度。     

Constructing iterative non-uniform B-spline curve and surface to fit data points

In this paper, based on the idea of profit and loss modification, we presentthe iterative non-uniform B-spline curve and surface to settle a key problem in computeraided geometric design and reverse engineering, that is, constructing the curve (surface)fitting (interpolating) a given ordered point set without solving a linear system. We startwith a piece of initial non-uniform B-spline curve (surface) which takes the given point setas its control point set. Then by adjusting its control points gradually with iterative formula,we can get a group of non-uniform B-spline curves (surfaces) with gradually higherprecision. In this paper, using modern matrix theory, we strictly prove that the limit curve(surface) of the iteration interpolates the given point set. The non-uniform B-spline curves(surfaces) generated with the iteration have many advantages, such as satisfying theNURBS standard, having explicit expression, gaining locality, and convexity preserving,etc     

Data reduction using cubic rational B-splines

A geometric method for fitting rational cubic B-spline curves to data representing smooth curves, such as intersection curves or silhouette lines, is presented. The algorithm relies on the convex hull and on the variation diminishing properties of Bezier/B-spline curves. It is shown that the algorithm delivers fitting curves that approximate the data with high accuracy even in cases with large tolerances. The ways in which the algorithm computes the end tangent magnitudes and inner control points, fits cubic curves through intermediate points, checks the approximate error, obtains optimal segmentation using binary search, and obtains appropriate final curve form are discussed     

Performing Efficient NURBS Modeling Operations on the GPU

We present algorithms for evaluating and performing modeling operations on NURBS surfaces using the programmable fragment processor on the Graphics Processing Unit (GPU). We extend our GPU-based NURBS evaluator that evaluates NURBS surfaces to compute exact normals for either standard or rational B-spline surfaces for use in rendering and geometric modeling. We build on these calculations in our new GPU algorithms to perform standard modeling operations such as inverse evaluations, ray intersections, and surface-surface intersections on the GPU. Our modeling algorithms run in real time, enabling the user to sketch on the actual surface to create new features. In addition, the designer can edit the surface by interactively trimming it without the need for retessellation. Our GPU-accelerated algorithm to perform surface-surface intersection operations with NURBS surfaces can output intersection curves in the model space as well as in the parametric spaces of both the intersecting surfaces at interactive rates. We also extend our surface-surface intersection algorithm to evaluate self-intersections in NURBS surfaces.     

An extension algorithm for B-splines by curve unclamping

This paper presents an algorithm for extending B-spline curves and surfaces. Based on the unclamping algorithm for B-spline curves, we propose a new algorithm for extending B-spline curves that extrapolates using the recurrence property of the de Boor algorithm. This algorithm provides a nice extension, with maximum continuity, to the original curve segment. Moreover, it can be applied to the extension of B-spline surfaces. Extension to both single and multiple target points/curves are considered in this paper.     

Generation of Discrete Bicubic G1 B-Spline Ship Hullform Surfaces from a Given Curve Network Using Virtual Iso-Parametric Curves

We propose a method that automatically generates discrete bicubic G1 continuous B-spline surfaces that interpolate the curve network of a ship hullform. First, the curves in the network are classified into two types: boundary curves and "reference curves". The boundary curves correspond to a set of rectangular (or triangular) topological type that can be represented with tensor-product (or degenerate) B-spline surface patches. Next, in the interior of the patches, surface fitting points and cross boundary derivatives are estimated from the reference curves by constructing "virtual" isoparametric curves. Finally, a discrete G1 continuous B-spline surface is generated by a surface fitting algorithm. Several smooth ship hullform surfaces generated from curve networks corresponding to actual ship hullforms demonstrate the quality of the method.     

Offset of curves on tessellated surfaces

Geodesic offset of curves on surfaces is an important and useful tool of computer aided design for applications such as generation of tool paths for NC machining and simulation of fibre path on tool surfaces in composites manufacturing. For many industrial and graphic applications, tessellation representation is used for curves and surfaces because of its simplicity in representation and for simpler and faster geometric operations. The paper presents an algorithm for computing offset of curves on tessellated surfaces. A curve on tessellation (COT) is represented as a sequence of 3D points, with each line segment of every two consecutive points lying exactly on the tessellation. With an incremental approach of the algorithm to compute offset COT, the final offset curve position is obtained through several intermediate offset curve positions. Each offset curve position is obtained by offsetting all the points of COT along the tessellation in such a way that all the line segments gets offset exactly along the faces of tessellation in which the line segments are contained. The algorithm, based entirely on tessellation representation, completely eliminates the formation of local self-intersections. Global self-intersections if any, are detected and corrected explicitly. Offset of both open and closed tessellated curves, either in a plane or on a tessellated surface, can be generated using the proposed approach. The computation of offset COT is very accurate within the tessellation tolerance.     

Contour curve reconstruction from cloud data for rapid prototyping

In this study, a method for generation of sectional contour curves directly from cloud point data is given. This method computes contour curves for rapid prototyping model generation via adaptive slicing, data points reducing and B-spline curve fitting. In this approach, first a cloud point data set is segmented along the component building direction to a number of layers. The points are projected to the mid-plane of the layer to form a 2-dimensional (2D) band of scattered points. These points are then utilized to construct a boundary curve. A number of points are picked up along the band and a B-spline curve is fitted. Then points are selected on the B-spline curve based on its discrete curvature. These are the points used as centers for generation of circles with a user-define radius to capture a piece of the scattered band. The geometric center of the points lying within these circles is treated as a control point for a B-spline curve fitting that represents a boundary contour curve. The advantage of this method is simplicity and insensitivity to common small inaccuracies. Two experimental results are included to demonstrate the effectiveness and applicability of the proposed method.