B样条曲面方向投影问题的几何计算方法

B样条曲面方向投影问题可以通过求解方程组的方法来解决.由于方程组所有根中往往只有一个或甚至没有根与待求解的最近点对应,因而绝大多数的求根计算量是不必要的.为此讨论了B样条曲面的方向投影问题,提出一种简单且高效稳定的几何计算方法.该方法充分利用了B样条函数的凸包性,同时结合B样条函数稳定可靠的分裂算法给出了相应的几何剪枝方法.与传统的求解非线性方程组的计算方法相比,文中方法可以剪除绝大部分非线性方程组对应的根,且不需要Newton迭代,可以应用于平面/B样条曲面间的求交测试问题及B样条曲面包围盒的计算问题.实例结果表明,该方法具有比传统的相关方法更高的计算效率和更好的稳定性.     

一种 G2 连续组合曲线的表示

针对 Bézier 曲线以及现有众多含形状参数的扩展 Bézier 曲线的 G2 拼接条件均对控制顶点有严 格要求的问题,拟提出一种 G2 连续组合曲线,其能综合 Bézier 与 B 样条方法的优点,其基函数具有显式表达 式,既具有 B 样条方法的自动光滑性,又能轻松拥有 Bézier 曲线的端点几何特征。为此,构造了一组含 6 个 参数的基函数,按照 3 次 Bézier 曲线的定义方式由之构造了基于 4 个控制顶点的曲线段,根据曲线段的拼接条 件,按照 3 次 B 样条曲线的定义方式构造了基于 4 点分段的组合曲线。基函数具有全正性,其同时包含 3 次 Bernstein 基函数和所有由内部节点重复度均为 1 的节点向量所确定的 3 次 B 样条基函数作为特例。曲线段具 有保凸性、端点位置以及形状可调性,其同时包含 3 次 Bézier 曲线和 3 次 B 样条曲线段作为特例。组合曲线 的定义方式自动保证了其整体 G2 连续,将部分参数取特定值,即可使其端点插值、端边相切,此时其中依然 存在用于调整内部形状的独立参数。按一定规则选取组合曲线中的参数,即可重构 C2 连续的 3 次 B 样条曲线。     

不规则网格上的曲面设计方法

提出一种在不规则网格上构造曲面的方法.其基本思想是,通过均匀双三次B样条基函数的分解和子基函数的分类,将B样条曲面方法推广到任意四边形网格.给定一个任意四边形控制网格,首先对每个控制点构造一个基函数;所有控制点加权组合形成整体曲面.构造的曲面是分片双三次有理参数多项式曲面.此方法可以看成是均匀B样条曲面构造方法的扩展,如果控制网格是规则四边形网格,那么构造得到的曲面与均匀双三次B样条曲面是一致的.最后,实例证明此方法能够有效地构造曲面.     

Method for intersecting algebraic surfaces with rational polynomial patches

The paper presents a hybrid algorithm for the computation of the intersection of an algebraic surface and a rational polynomial parametric surface patch. This algorithm is based on analytic representation of the intersection as an algebraic curve expressed in the Bernstein basis; automatic computation of the significant points of the curve using numerical techniques, subdivision and convexity properties of the Bernstein basis; partitioning of the intersection domain at these points; and tracing of the resulting monotonic intersection segments using coarse subdivision and faceting methods coupled with Newton techniques. The algorithm described in the paper treats intersections of arbitrary order algebraic surfaces with rational biquadratic and bicubic patches and introduces efficiency enhancements in the partitioning and tracing parts of the solution process. The algorithm has been tested with up to degree four algebraics and bicubic patches.     

Variational Modeling of Free-form Curve and Surface Using Wavelet Basis Functions

Variational modeling approach is often used to interactively design free-form curves and surfaces. Traditionally, a variational problem can be transformed to the optimization of control points. Unfortunately, as the number of basis functions grows, the local support property of B-spline often makes the computation of an optimization system time-consuming. To solve this problem, wavelet basis instead of B-spline basis is used to represent the curves or surfaces. Because the wavelet basis is a hierarchical basis with multiresolution property, the coarse wavelet basis can be used to describe the overall shape of the curves/surfaces, while the finer wavelet basis used to describe the details of the curves/surfaces. Thus, the computing speed of the optimization system can be raised greatly.     

Geometric algorithm for point projection and inversion onto Bézier surfaces

This paper presents an accurate and efficient method for the computation of both point projection and inversion onto Bézier surfaces. First, these two problems are formulated in terms of solution of a polynomial equation with u and v variables expressed in the Bernstein basis. Then, based on subdivision of the Bézier surface and the recursive quadtree decomposition, a novel solution method is proposed. The computation of point projection is shown to be equivalent to the geometrically intuitive intersection of a surface with the u-v plane. Finally, by comparing the distances between the test point and the candidate points, the closest point is found. Examples illustrate the feasibility of this method.     

Three-dimensional Bézier interpolation in solid modeling and grid generation

Bézier and B-spline patches are popular tools in surface modeling. With these methods, a surface is represented by the product of univariate approximations. The extension of this concept to three-dimensions is straightforward and can be applied to the problem of grid generation. This report will demonstrate how rational Bézier basis functions can be used to generate three-dimensional solids that can be used in solid modeling and in the generation of grids. Examples will be given demonstrating the ability to generated three-dimensional grids directly from a set of data points without having to first set up the boundary surfaces. Many geometric grid properties can be imposed by the proper choice of the control net, the weights, and the twist models.     

货郎担问题的几何解法

本文提出货郎担问题的一种新的求解方法，即几何解法．它的时间复杂性为：求距离运算次数为Ｏ（ｎｍ），比较次数为Ｏ（ｍａｘ（ｎｍ，ｎｌｏｇｎ）），求夹角次数为Ｏ（n²/m），其中ｎ为点集中点的数目，ｍ为点集的凸包顶点数．     

Geometric algorithm for point projection and inversion onto Bézier surfaces

This paper presents an accurate and efficient method for the computation of both point projection and inversion onto Bézier surfaces. First, these two problems are formulated in terms of solution of a polynomial equation with u and v variables expressed in the Bernstein basis. Then, based on subdivision of the Bézier surface and the recursive quadtree decomposition, a novel solution method is proposed. The computation of point projection is shown to be equivalent to the geometrically intuitive intersection of asurface with the u-ν plane. Finally, by comparing the distances between the test point and the candidate points, the closest point is found. Examples illustrate the feasibility of this method.     

Control point adjustment for B-spline curve approximation

Pottmann et al. propose an iterative optimization scheme for approximating a target curve with a B-spline curve based on square distance minimization, or SDM. The main advantage of SDM is that it does not need a parameterization of data points on the target curve. Starting with an initial B-spline curve, this scheme makes an active B-spline curve converge faster towards the target curve and produces a better approximating B-spline curve than existing methods relying on data point parameterization. However, SDM is sensitive to the initial B-spline curve due to its local nature of optimization. To address this, we integrate SDM with procedures for automatically adjusting both the number and locations of the control points of the active spline curve. This leads to a method that is more robust and applicable than SDM used alone. Furthermore, it is observed that the most time consuming part of SDM is the repeated computation of the foot-point on the target curve of a sample point on the active B-spline curve. In our implementation, we speed up the foot-point computation by pre-computing the distance field of the target curve using the Fast Marching Method. Experimental examples are presented to demonstrate the effectiveness of our method. Problems for further research are discussed.     

平面点匹配的一点校准算法

点模式匹配是一项重要的视觉课题。对于一个平面点集,由平移和旋转并伴有一定噪声作用产生另一点集,提出一个基于一点校准的点模式快速匹配算法,并推广到带有属性点的匹配问题中。基于一点校准的点模式匹配算法,其计算复杂性为O(mn),其中m,n分别是两个点集所含点的个数,比基于两点距离近似相等的校准匹配算法,其计算复杂性为O(m2nl)(其中l为第二个点集中与第一个点集中任两个点的距离近似相等的平均个数),极大地减少了计算量。     

Cubic B-spline curve approximation by curve unclamping

A new approach for cubic B-spline curve approximation is presented. The method produces an approximation cubic B-spline curve tangent to a given curve at a set of selected positions, called tangent points, in a piecewise manner starting from a seed segment. A heuristic method is provided to select the tangent points. The first segment of the approximation cubic B-spline curve can be obtained using an inner point interpolation method, least-squares method or geometric Hermite method as a seed segment. The approximation curve is further extended to other tangent points one by one by curve unclamping. New tangent points can also be added, if necessary, by using the concept of the minimum shape deformation angle of an inner point for better approximation. Numerical examples show that the new method is effective in approximating a given curve and is efficient in computation.     

A new approach for online multiobjective optimization of mechatronic systems

We present a new concept for online multiobjective optimization and its application to the optimization of the operating point assignment for a doubly-fed linear motor. This problem leads to a time-dependent multiobjective optimization problem. In contrast to classical optimization where the aim is to find the (global) minimum of a single function, we want to simultaneously minimize k objective functions. The solution to this problem is given by the set of optimal compromises, the so-called Pareto set. In the case of the linear motor, there are two conflicting aims which both have to be maximized: the degree of efficiency and the inverter utilization factor. The objective functions depend on velocity, force and power, which can be modeled as time-dependent parameters. For a fixed point of time, the entire corresponding Pareto set can be computed by means of a recently developed set-oriented numerical method. An online computation of the time-dependent Pareto sets is not possible, because the computation itself is too complex. Therefore, we combine the computation of the Pareto set with numerical path following techniques. Under certain smoothness assumptions the set of Pareto points can be characterized as the set of zeros of a certain function. Here, path following allows to track the evolution of a given solution point through time.     

拥有指数参数的新三角基

目的 为了使构造的曲线拥有传统Bézier曲线的良好性质,同时还具备形状可调性、逼近性、保形性以及实用性。方法 首先在拟扩展切比雪夫空间的框架下,构造了一类具有全正性的拟三次三角Bernstein基函数,并给出了该基函数的性质;基于此基函数,构造了相应的拟三次三角Bézier曲线,分析了其曲线的性质,得到了生成曲线的割角算法以及C¹,C²光滑拼接条件,同时还提出了一种估计曲线逼近控制多边形程度的三角Bernstein算子;接着在拟三次三角Bernstein基函数的基础上提出一种三角域上带3个指数参数的拟三次三角Bernstein-Bézier基,基于此基生成了一种三角域上的拟三次三角Bernstein-Bézier曲面,该曲面可以构建边界为椭圆弧、抛物线弧以及圆弧的曲面,此外,还提出一种实用的de-Casteljau-type算法,同时还给出了连接两个曲面的G¹连续条件。结果 实验表明,本文在拟扩展切比雪夫空间中构造的具有全正性的曲线曲面,能够灵活地进行形状调整,而且具有良好的逼近性以及适用性。结论 本文在拟扩展切比雪夫空间的框架下构造了一类具有全正性的基函数,并以此基函数进行曲线曲面构造。实验表明本文构造的曲线具备传统三次Bézier曲线的所有优良性质,而且具有灵活的形状可调性。随着参数的增大,所生成的曲线能够更加逼近控制多边形,模拟控制多边形的行为。此外,本文在三角域上构造的曲面能够生成边界为椭圆弧的曲面。综上,本文提出的基函数满足几何工业的需要,是一种实用的方法。     

Computing the Hausdorff distance between two B-spline curves

This paper presents a geometric pruning method for computing the Hausdorff distance between two B-spline curves. It presents a heuristic method for obtaining the one-sided Hausdorff distance in some interval as a lower bound of the Hausdorff distance, which is also possibly the exact Hausdorff distance. Then, an estimation of the upper bound of the Hausdorff distance in an sub-interval is given, which is used to eliminate the sub-intervals whose upper bounds are smaller than the present lower bound. The conditions whether the Hausdorff distance occurs at an end point of the two curves are also provided. These conditions are used to turn the Hausdorff distance computation problem between two curves into a minimum or maximum distance computation problem between a point and a curve, which can be solved well. A pruning technique based on several other elimination criteria is utilized to improve the efficiency of the new method. Numerical examples illustrate the efficiency and the robustness of the new method.     

带形状参数的Bernstein-Bézier曲面

虽然三角域上的曲面造型方法能有效解决不规则产品的几何造型问题, 在实际工程中有着广泛的应用, 但由于其结构的特殊性和复杂性, 目前对三角域曲面的扩展研究并不多。为了丰富三角域曲面的理论, 针对如何增强三角域曲面形状表示的灵活性进行了专门的研究。首先构造了一组三角域上含一个参数的四次多项式基函数, 它是三角域上二次Bernstein基函数的扩展。然后用递推的方式定义了三角域上含一个参数的n+2次多项式基函数, 它是三角域上n次Bernstein基函数的扩展。基于新的n+2次多项式基函数, 定义了相应的n阶三角域曲面。分析了基函数和曲面的性质, 新曲面不仅具备三角域上Bernstein Bézier曲面的基本性质, 而且还可以在不改变控制顶点的情况下, 通过改变参数的值来自由调整曲面的形状。     

混合有理Bézier曲面及其三维重建

文章将Bernstein基函数与有理Bernstein基函数相结合,构造了一类新型有理曲面-混合有理Bézier曲面;给出了该类曲面的生成方法并讨论了曲面的性质。另一方面,在一种基于Newton-Thiele型非线性方法的插值曲面的三维重建理论基础上,讨论了由离散点集重建混合有理Bézier曲面的问题,为图形图象处理等研究领域提供了新的算法理论。     

基于B 样条曲面插值误差控制的内超环面齿轮齿面建模

针对内超环面齿轮齿面数控加工精度难以保证的问题,提出一种基于B 样条曲面 插值误差控制的内超环面齿轮齿面建模的方法。该方法以内超环面齿轮理论齿面原型为依据, 运用B 样条曲面构造插值曲面,计算插值曲面片与理论齿面之间的误差。通过插值误差分析, 根据误差分布特点,将型值点网格不断细化,获得一组型值点阵,经插值重构后可得到满足精 度要求的内超环面齿轮齿廓模型。最后,通过数控加工验证了建模的有效性。基于B 样条曲面 插值误差控制的内超环面齿轮齿面建模方法为获得高精度的内超环面齿轮实体模型奠定了理 论基础。     

Representation of piecewise continuous algebraic surfaces in terms of B-splines

A method for representing shape using portions of algebraic surfaces bounded by rectangular boxes defined in terms of triple product Bernstein polynomials is described and some of its properties are outlined. The method is extended to handle piecewise continuous algebraic surfaces within rectangular boxes defined in terms of triple products of B-spline basis functions. Next, two techniques for sculptured shape creation are studied. The first is based on geometric manipulation of existing primitives and the second on approximation/interpolation of lower dimensional entities using least-squares techniques based on singular value decomposition. In addition, several interrogation techniques, such as contouring, ray tracing and curvature evaluation, used in the design and analysis of piecewise continuous algebraic surfaces are discussed.     

矩形网格上二元矩阵切触有理插值的新方法

熟知的矩阵切触有理插值的方法都与连分式有关,不仅计算繁琐,而且难以避免出现“极点、不可达点”。用网格点构造有理插值基函数,用型值点构造具有承袭性的各阶矩阵插值算子,通过插值基函数与插值算子作线性运算,构造出二元矩阵各阶切触有理插值函数,有效避免了有理插值的“极点、不可达点”问题。若选择适当的参数,还可以任意降低插值函数的次数,数值例子表明了该方法简单、有效、实用性强。