平面三次NURBS曲线的自动光顺算法

针对平面三次NURBS曲线的光顺问题，基于节点插入，节点消法和重新确定权因子等技术，给出了平面三次NURBS曲线的一种同算法，算法根据给定的光顺准则，自动选择需要光顺的节点，局部修改控制顶点和权因子。     

Determining Knots by Minimizing Energy

A new method for determining knots to construct polynomial curves is presented. At each data point, a quadric curve which passes three consecutive points is constructed. The knots for constructing the quadric curve are determined by minimizing the internal strain energy, which can be regarded as a function of the angle. The function of the angle is expanded as a Taylor series with two terms, then the two knot intervals between the three consecutive points are defined by linear expression. Between the two consecutive points, there are two knot intervals, and the combination of the two knot intervals is used to define the final knot interval. A comparison of the new method with several existing methods is included.     

基于极小化二阶导矢确定节点

构造参数拟合曲线的关键问题之一是为每个数据点指定一个参数值（节点）。提出了一种确定节点的新方法。对于每个数据点,新方法由相邻的三个数据点构造一条二次多项式曲线,二次曲线的节点通过极小化其二阶导矢的平方确定。两个相邻数据点间的节点区间由两条二次曲线确定。为使节点计算公式能有效反映出相邻数据点的变化情况,新方法改进了修正弦长方法并应用于节点计算。新方法是一个局部化方法,因此适合于曲线曲面的交互设计。实验结果说明,新方法比其他节点计算方法有效。     

Reducing control points in lofted B-spline surface interpolation using common knot vector determination

A new algorithm for reducing control points in lofted surface interpolation to rows of data points is presented in this paper. The key step of surface lofting is to obtain a set of compatible B-spline curves interpolating each row. Given a set of points and their parameterization, a necessary and sufficient condition is proposed to determine the existence of interpolating B-spline curves defined on a given knot vector. Based on this condition, we first properly construct a common knot vector that guarantees the existence of interpolating B-spline curves to each row of points. Then we calculate a set of interpolating B-spline curves defined on the common knot vector by energy minimization. Using this method, fewer control points are employed while maintaining a visually pleasing shape of the lofted surface. Several experimental results demonstrate the usability and quality of the proposed method.     

多结点样条插值及其多尺度细化算法

针对风线与曲面拟事问题，研究多结点样条插值方法。这类方法具有基数型，显式计算及局部性等优点。主要的新结果是：对多结点样条基本函数的构造给出了新的表述；提出了一类新的不带移动的混合形多结点样条基本函数；基于多尺度分析的思想，给出了一种自适应的细化算法，它对消减采样数据的相关性是简便有效的。     

Knot selection by boosting techniques

A novel concept for estimating smooth functions by selection techniques based on boosting is developed. It is suggested to put radial basis functions with different spreads at each knot and to perform selection and estimation simultaneously by a componentwise boosting algorithm. The methodology of various other smoothing and knot selection procedures (e.g. stepwise selection) is summarized. They are compared to the proposed approach by extensive simulations for various unidimensional settings, including varying spatial variation and heteroskedasticity, as well as on a real world data example. Finally, an extension of the proposed method to surface fitting is evaluated numerically on both, simulation and real data. The proposed knot selection technique is shown to be a strong competitor to existing methods for knot selection.     

Creases and boundary conditions for subdivision curves

Our goal is to find subdivision rules at creases in arbitrary degree subdivision for piece-wise polynomial curves, but without introducing new control points e.g. by knot insertion. Crease rules are well understood for low degree (cubic and lower) curves. We compare three main approaches: knot insertion, ghost points, and modifying subdivision rules. While knot insertion and ghost points work for arbitrary degrees for B-splines, these methods introduce unnecessary (ghost) control points.The situation is not so simple in modifying subdivision rules. Based on subdivision and subspace selection matrices, a novel approach to finding boundary and sharp subdivision rules that generalises to any degree is presented. Our approach leads to new higher-degree polynomial subdivision schemes with crease control without introducing new control points.     

Target shape design optimization by evolving B-splines with cooperative coevolution

With high reputation in handling non-linear and multi-model problems with little prior knowledge, evolutionary algorithms (EAs) have successfully been applied to design optimization problems as robust optimizers. Since real-world design optimization is often computationally expensive, target shape design optimization problems (TSDOPs) have been frequently used as efficient miniature model to check algorithmic performance for general shape design. There are at least three important issues in developing EAs for TSDOPs, i.e., design representation, fitness evaluation and evolution paradigm. Existing work has mainly focused on the first two issues, in which (1) an adaptive encoding scheme with B-spline has been proposed as a representation, and (2) a symmetric Hausdorff distance based metric has been used as a fitness function. But for the third issue, off-the-shelf EAs were used directly to evolve B-spline control points and/or knot vector. In this paper, we first demonstrate why it is unreasonable to evolve the control points and knot vector simultaneously. And then a new coevolutionary paradigm is proposed to evolve the control points and knot vector of B-spline separately in a cooperative manner. In the new paradigm, an initial population is generated for both the control points, and the knot vector. The two populations are evolved mostly separately in a round-robin fashion, with only cooperation at the fitness evaluation phase. The new paradigm has at least two significant advantages over conventional EAs. Firstly, it provides a platform to evolve both the control points and knot vector reasonably. Secondly, it reduces the difficulty of TSDOPs by decomposing the objective vector into two smaller subcomponents (i.e., control points and knot vector). To evaluate the efficacy of the proposed coevolutionary paradigm, an algorithm named CMA-ES-CC was formulated. Experimental studies were conducted based on two target shapes. The comparison with six other EAs suggests that the proposed cooperative coevolution paradigm is very effective for TSDOPs.     

改进C-V模型的木材缺陷彩色图像分割研究

分析了木材节子缺陷图像的特点,将彩色图像作为一个整体的图像进行处理,保护了彩色图像信息的特性,提出了一种基于AOS的扩展C-V矢量模型及背景填充耦合的木材节子缺陷彩色图像分割算法。对Chan-Vese提出的基于Mumford-Shah模型的水平集矢量图像分割模型进行了改进,使分割速度得到了提高;用AOS算法改进了原模型的差分格式,使得差分格式无条件稳定;结合背景填充技术,使得到的新图像缩减了目标与背景间的特征差别。实验结果表明该方法可以较好地实现对木材死节、活节和虫眼等缺陷的彩色图像分割,也可实现对单板多节子缺陷彩色图像的分割,为木材缺陷边缘检测提供一种行之有效的方法。     

Wavelet-Based Data Reduction of B-Spline Curves

1 Introduction The problem of reducing the amount of data in the representation of a function or a curve is not new. Many papers have already been published. In these strategies, two trends can be emphasized[1]. The first one deals with polygonal curves for approximating data[2],[3]. Another approach is based on spline curves[4]~[8]. In the first approach, the problem is formulated so that the perpendicular distance of each point on the curve to the fitted line segments is within a predefined…     

The conversion of a dynamic B-spline curve into piecewise polynomials in power form

The evaluation of points and the computations of inflection points or cusps on a curve are often necessary in CAGD applications. When a curve is represented in a B-spline form, such computations can be made easier once it is transformed into a set of piecewise polynomial curves in power form. The usual practice of the transformation of a B-spline curve into a set of piecewise polynomial curves in power form is done either by a knot refinement followed by basis conversions, or by applying a Taylor expansion on each knot span of a B-spline curve.Presented in this paper is a new algorithm to convert a B-spline curve into a set of piecewise polynomial curves in power form. Experiment shows that the proposed algorithm significantly outperforms the conventional approach when one or more control points of a B-spline curve are continuously moving.     

Bézier样条曲线的近似弧长参数化方法

提出了Bézier样条曲线近似弧长参数化的方法及相应的算法。通过求出曲线近似二分之一弧长的点及其相应的参数值,可将曲线分割为两条Bézier样条曲线。这两条曲线的弧长近似相等,因此让它们带有相同的权1。对新生成的Bézier样条曲线不断重复上述工作,最终得到一条由多条Bézier样条曲线所构成的新的曲线。将这多条Bézier样条曲线合并为一条Bézier样条曲线,进而通过节点插入技术将其转化为B样条形式的曲线以便得到全局参数,其中各段Bézier曲线在全局参数域中所占子区间的长度与它们所具有的权成比例,这样便得到一条近似弧长参数化曲线。     

浅谈中国结元素在现代产品设计中的应用

中国结站在一个文化传承的起点上,体现了美与真、善的和谐统一,是内容与形式美的一种结合体。本文回顾了中国结文化的产生与发展,探讨了中国结作为独立符号系统的特性,以及中国结在现实生活中的象征意义,通过本文的研究,总结出中国结元素应用于设计的可行性设计规律,设计出中国结应用于在新的现代产品,从而保护弘扬民族物质文化遗产。     

一种低次的变次数样条曲线的细分算法

提出一种变次数样条曲线的细分算法,在细分前可指定每段的次数和异次段间的连续性,其中, 每段的次数可在[1,4]上任选,异次段间的连续性可在 C0 和 C1 中任选,同次段间的连续阶为次数减 1。算法使 用变次数样条的插节点性质,在所有非零节点区间中,整体插入中点,精确地给出细分前后基函数的关系,同 时,利用细分生成的变次数样条的节点区间与次数成比例的方法,使得细分过程中,异次段间的插值系数较为 简单。细分过程可表示为线性插值的形式,但不同于非对称的每段分别进行的局部插值方法,而是具有类似均 匀 B 样条的 Lane-Riesenfeld 细分的整体插值方式,因此,包含次数≤4 时的 Lane-Riesenfeld 细分方法。     

Surface reconstruction using bivariate simplex splines on Delaunay configurations

Recently, a new bivariate simplex spline scheme based on Delaunay configuration has been introduced into the geometric computing community, and it defines a complete spline space that retains many attractive theoretic and computational properties. In this paper, we develop a novel shape modeling framework to reconstruct a closed surface of arbitrary topology based on this new spline scheme. Our framework takes a triangulated set of points, and by solving a linear least-square problem and iteratively refining parameter domains with newly added knots, we can finally obtain a continuous spline surface satisfying the requirement of a user-specified error tolerance. Unlike existing surface reconstruction methods based on triangular B-splines (or DMS splines), in which auxiliary knots must be explicitly added in advance to form a knot sequence for construction of each basis function, our new algorithm completely avoids this less-intuitive and labor-intensive knot generating procedure. We demonstrate the efficacy and effectiveness of our algorithm on real-world, scattered datasets for shape representation and computing.     

Lofted B-spline surface interpolation by linearly constrained energy minimization

This paper proposes a new approach for lofted B-spline surface interpolation to serial contours, where the number of points varies from contour to contour. The approach first finds a common knot vector consisting of fewer knots that contain enough degrees of freedom to guarantee the existence of a B-spline curve interpolating each contour. Then, it computes from the contours a set of compatible B-spline curves defined on the knot vector by adopting B-spline curve interpolation based on linearly constrained energy minimization. Finally, it generates a B-spline surface interpolating the curves via B-spline surface lofting. As the energy functional is quadratic, the energy minimization problem leads to that of solving a linear system. The proposed approach is efficient in computation and can realize more efficient data reduction than previous approaches while providing visually pleasing B-spline surfaces. Moreover, the approach works well on measured data with noise. Some experimental results demonstrate its usefulness and quality.     

结点插值新算法

结点插值算法广泛应用开发系统样条曲线、曲面的生成表示和求交分类。本文给出的结点插值新算法不仅可以统一表示已知的Boehm算法和Oslo算法,而且算法效率上优于它们。本算法已用于三维几何造型系统GEMS中。     

五阶与六阶三角样条曲线

利用三角函数构造了两个含参数的函数组,它们分别由6 个、7 个函数组 成,分析了这两个函数组的性质。由这两组函数定义了两种新的样条曲线,它们分别具有与 五次、六次B 样条曲线相同的结构。新曲线在继承B 样条曲线基本性质的同时,又具备了 一些新的优点。例如,在等距节点下,新曲线在节点处均可以达到C5 连续,而且在不改变 控制顶点的情况下,新曲线的形状均可以通过改变形状参数的值进行调整。另外,给出了使 新曲线插值于控制多边形首末端点的方法,以及构造闭曲线的方法等,文中的图例说明了新 方法的正确性和可行性。     

Degree elevation of unified and extended spline curves

Unified and extended splines （UE-splines）, which unifl and extend polynomial, trigonometric, and hyperbolic B-splines, inherit most properties of B-splines and have some advantages over B-splines. The interest of this paper is the degree elevation algorithm of UE-spline curves and its geometric meaning. Our main idea is to elevate the degree of UE-spline curves one knot interval by one knot interval. First, we construct a new class of basis functions, called bi-order UE-spline basis flmctions which are defined by the integral definition of splines. Then some important properties of bi-order UE-splines are given, especially for tile transformation formulae of the basis functions before and after inserting a knot into the knot vector. Finally, we prove that the degree elevation of UE-spline curves can be interpreted as a process of corner cutting on the control polygons, just as in the manner of B-splines. This degree elevation algorithm possesses strong geometric intuition.     

NURBS曲面模型鲁棒数字水印嵌入算法

随着计算机多媒体技术的快速发展，如何保护数字产品不被复制、盗用、篡改已成为信息安全领域中亟待解决的问题，数字水印技术成为解决该问题的一种新方法。该文基于非均匀有理B样条（NURBS）节点插入方法和扩频通信技术提出了NURBS曲面模型鲁棒水印嵌入算法，该算法嵌入的水印信息具有不可见性，能够抵抗节点插入、节点删除、节点细化、次数提升和仿射变换（平移、旋转、缩放）等NURBS模型常见攻击。仿真实验验证了算法的有效性。