带有面积约束的B样条曲线拟合方法

1984年刘鼎元等给出了B样条曲线的光顺拟合方法,本文在其基础上处理了带有面积约束的B样条曲线拟合问题。它来源于船舶线型设计:设计者往往先确定横剖面面积曲线,再设计线型。因而,在横剖面的光顺拟合中,就要求各站的横剖面面积保持不变。本文用B样条参数曲线表达拟合曲线,导出了曲线与坐标轴所围面积的表达式,目标函数由偏离的平方和、二阶导数平方和以及Lagrange乘子与面积公式的乘积所组成。     

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

在空间Ω_5=span{1,sinh t,cosh t,sinh 2t,cosh 2t}上给出了二次带形状参数双曲B样条的基函数.由这组基组成的二次双曲B样条曲线是C~1连续的,同时具有很多与二次B样条曲线类似的性质和几何结构,并且可以精确表示双曲线.在控制多边形固定的情况下,可以通过调节形状参数的大小来进一步调整曲线的形状.     

STUDY OF THE SMOOTH DEGREE OF THE CLOSED C-B（E）ZIER AND B-TYPE SPLINE CURVE

本文研究了与多边形相切的样条曲线的构造方法和基本属性问题,给出了曲线光顺度的一般定义和计算方法.利用该方法对分段C-Bézier曲线、4-5-5-4次交错B-样条曲线和3阶B样条曲线的光顺度进行计算,获得了3阶B样条曲线最为光顺的结果.     

C-Bézier和B-型样条闭曲线光滑性研究

本文研究了与多边形相切的样条曲线的构造方法和基本属性问题,给出了曲线光顺度的一般定义和计算方法.利用该方法对分段C-Bézier曲线、4-5-5-4次交错B-样条曲线和3阶B样条曲线的光顺度进行计算,获得了3阶B样条曲线最为光顺的结果.     

周期B样条基转换矩阵的表示和计算

周期B样条基以一种简洁的形式表示闭B样条曲线.周期B样条基转换矩阵为闭B样条曲线及相关曲面的不同表示间的转换提供了一个数学模型.本文给出了周期B样条基转换矩阵的存在性条件,给出并证明了周期B样条基转换矩阵的一个简单的递归表示式.在此基础上,本文进一步给出了周期B样条基转换矩阵的计算公式和高效算法.周期B样条基转换矩阵为闭B样条曲线的节点插入、升阶、节点删除和降阶等基本运算提供了一个统一而简单的解决方法,本文给出了一些应用例子.     

样条曲线光顺的数学模型分析

采用函数三次样条光顺曲线,证明在样条曲线局部转角小,总转角不超过120°情况下,曲线的光顺指示函数y″(1+y′2)3/2可以简化为二阶导数曲线y″(x).由于y″(x)对x是分段折线函数,对y是线性泛函,因而定出不光顺之处及用叠加原理计算调整公式均变得很简单.此样条函数曲线光顺能够采用电脑自动化进行.     

有理B样条曲线的光顺拟合法

研究了用三次均匀有理Ｂ样条样曲线光顺拟合一组平面点列的问题,其中光顺性由曲线的能量积分与扰动的权平均来确定。     

一类可调的插值向量样条——PB 样条曲线

在几何外形的计算机辅助设计中,已有的用于插值的三次样条曲线一般都是整体构造,计算上表现为需要求解一个三对角方程组,不易于局部修改.本文利用轴向任意的抛物线调配的方法,构造了一种可控制的空间插值三次参数样条——PB 样条曲线.它的特点是几何不变,构造局部,计算简单不需要迭代反解,保凸性能较好,局部修改方便,并可拓广到曲面的插值中去.文中分析了它的几何性质和保凸条件,得出了光顺性定理,并提出了调整参量 λ_i 进行局部修改消除多余拐点和控制形状的方法.根据本文的算法编制的程序 NNP 用于构造曲线取得了良好的效果.     

一类双k次B样条曲面的G1连续性条件

本文针对两个k×k次B样条曲面的节点向量为端点插值、内部是单节点的情形 ,给出它们之间的G1光滑拼接条件 ,同时得到它们的公共边界曲线的控制顶点所要满足的本征方程 .其中本征方程是B样条曲面片所独有的现象 .     

局部形状可调整的三次有理B样条插值曲线

利用三次非均匀有理B样条,给出了一种构造局部插值曲线的方法,生成的插值曲线是C2连续的.曲线表示式中带有一个局部形状参数,随着一个局部形状参数值的增大,所给曲线将局部地接近插值点构成的控制多边形.基于三次非均匀有理B样条函数的局部单调性和一种保单调性的准则,给出了所给插值曲线的保单调性的条件.     

An automated curve fairing algorithm for cubic B-spline curves

The fairing of contours is an important part of the computerised production of curved objects. A number of different fairing strategies have been proposed. In a recent paper we have introduced an extension of Kjellander's algorithm for fairing parametric B-splines, which can be applied to a wide range of two- and three-dimensional curves. In this paper we describe developments towards a fully automated fairing procedure based on our new algorithm. Like that of Kjellander, our algorithm fairs by an iterative process. The key problems are to decide which points need to be faired and how many times to iterate. Sapidis (1992) has proposed a curve fairness indicator to locate points to be faired and a criterion for termination of fairing. However, we have found that for interpolating curves with great variation in curvature Sapidis' criterion tends to concentrate fairing on regions with large curvature. Therefore we have developed a new scale-independent curve fairness indicator which does not suffer from this drawback. A number of examples of faired curves are presented.     

Constructing Invariant Fairness Measures for Surfaces

The paper proposes a rational method to derive fairness measures for surfaces. It works in cases where isophotes, reflection lines, planar intersection curves, or other curves are used to judge the fairness of the surface. The surface fairness measure is derived by demanding that all the given curves should be fair with respect to an appropriate curve fairness measure. The method is applied to the field of ship hull design where the curves are plane intersections. The method is extended to the case where one considers, not the fairness of one curve, but the fairness of a one parameter family of curves. Six basic third order invariants by which the fairing measures can be expressed are defined. Furthermore, the geometry of a plane intersection curve is studied, and the variation of the total, the normal, and the geodesic curvature and the geodesic torsion is determined.     

Design and shape adjustment of developable surfaces

This paper presents two direct explicit methods of computer-aided design for developable surfaces. The developable surfaces are designed by using control planes with C-Bézier basis functions. The shape of developable surfaces can be adjusted by using a control parameter. When the parameter takes on different values, a family of developable surfaces can be constructed and they keep the characteristics of Bézier surfaces. The thesis also discusses the properties of designed developable surfaces and presents geometric construction algorithms, including the de Casteljau algorithm, the Farin–Boehm construction for G² continuity, and the G² Beta restricted condition algorithm. The techniques for the geometric design of developable surfaces in this paper have all the characteristics of existing approaches for curves design, but go beyond the limitations of traditional approaches in designing developable surfaces and resolve problems frequently encountered in engineering by adjusting the position and shape of developable surfaces.     

The fairing and G1 continuity of quartic C‐Bézier curves

Quartic C‐Bézier curves possess similar properties with the traditional Bézier curves including terminal property, convex hull property, affine invariance, and approaching the shape of their control polygons as the shape parameter α decreases. In this paper, by adjusting the shape parameter α on the basis of the utilization of the least square approximation and nonlinear functional minimization together with fairing of a quartic C‐Bézier curve with G¹ continuity of quartic C‐Bézier curve segments, we develop a fairing and G¹ continuity algorithm for any given stitching coefficients λ_k(k = 1,2,…,n ? 1). The shape parameters α_i(i=1, 2, …, n) can be adjusted by the value of control points. The curvature of the resulting quartic C‐Bézier curve segments after fairing is more uniform than before. Moreover, six examples are provided in the paper to demonstrate the efficacy of the algorithm and illustrate how to apply this algorithm to the computer‐aided design/computer‐aided manufacturing modeling systems. Copyright © 2015 John Wiley & Sons, Ltd.     

Counterexamples to Mercat’s conjecture

In this paper, we provide counterexamples to Mercat’s conjecture on vector bundles on algebraic curves. For any \({n \geq 4}\), we provide examples of curves lying on K3 surfaces and vector bundles on those curves which invalidate Mercat’s conjecture in rank n.     

Polynomial-based non-uniform interpolatory subdivision with features control

Starting from a well-known construction of polynomial-based interpolatory 4-point schemes, in this paper we present an original affine combination of quadratic polynomial samples that leads to a non-uniform 4-point scheme with edge parameters. This blending-type formulation is then further generalized to provide a powerful subdivision algorithm that combines the fairing curve of a non-uniform refinement with the advantages of a shape-controlled interpolation method and an arbitrary point insertion rule. The result is a non-uniform interpolatory 4-point scheme that is unique in combining a number of distinctive properties. In fact it generates visually-pleasing limit curves where special features ranging from cusps and flat edges to point/edge tension effects may be included without creating undesired undulations. Moreover such a scheme is capable of inserting new points at any positions of existing intervals, so that the most convenient parameter values may be chosen as well as the intervals for insertion.Such a fully flexible curve scheme is a fundamental step towards the construction of high-quality interpolatory subdivision surfaces with features control.     

计算机辅助几何设计中极小曲面造型的研究进展

极小曲面在工程领域有着广泛应用,因此将其引入计算机辅助几何设计领域具有重要意义.详细概述了近年来计算机辅助几何设计领域中极小曲面造型的研究工作,按照造型方法的不同,可将现有工作分为精确造型方法和逼近造型方法两类.精确造型方法主要包括两个部分:某些特殊极小曲面的控制网格表示与构造;等温参数多项式极小曲面的挖掘与性质.逼近造型方法主要包括3个部分t基于数值计算的逼近方法;基于线性偏微分方程的逼近方法;基于能量函数最优化的逼近方法.最后对这些方法进行了分析比较,并讨论了极小曲面造型中有待进一步解决的问题.     

平面点列的自动光顺算法

本文考虑平面点列的光顺问题并将该问题化成最小能量曲线的构成问题，即在原点列和相应允许误差构成的带状区域内构造一条最小能量曲线并给出一种自动算法．整个光顺过程分成两步，第一步利用凸分析原理在原点列的允许变动范围内除去多余拐点；第二步在保凸的前提下构造插值点列的最小能量曲线并通过对最小能量曲线进行修正而达到对原型值点列进行光顺的目的．光顺结果不仅可以得到一光顺点列，同时还得到了一条插值点列的光顺曲线．该方法可以对分布不均匀甚至有较大转角的点列进行光顺，与已有的方法比起来具有光顺能力强光顺范围广的特点．     

Approximate implicitization and recursive surface intersection algorithms

Most published work on intersection algorithms for Computer Aided Design (CAD) systems addresses transversal intersections [1], situations where the surface normals of the surfaces intersected are well separated along all intersection curves. For transversal intersections the divide and conquer strategy of recursive subdivision, Sinha's theorem [2] and the convex hull property of NonUniform Rational B-Spline surfaces (NURBS) efficiently identify all intersection branches. However, in singular or near singular intersections, situations where the surfaces are parallel or near parallel in an intersection region, along an intersection curve or in an intersection point, even deep levels of subdivision will frequently not sort out the intersection topology. The paper will focus on the novel approach of Approximate Implicitization to address these challenges. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Correspondence and (2,1)-Bézier Surfaces

Tom Sederberg's method of moving curves (surfaces) is a new and effective tool for implicitizing curves (surfaces). From our point of view, the curve (surface) can be defined by using moving curves (surfaces) which in algebraic geometry are called correspondences. It turns out that from this definition we can easily derive both parametric and implicit representations of the curve (surface). In this paper, we investigate the geometry of the bi-degree (2,1)-Bézier surface and study the relationship between singularities and correspondences. We also characterize all the possible singular curves in terms of the control points of the surface.