Plus curves and surfaces

The formulations for parametric curves and surfaces that are based on control points are revised to use control lines and control planes instead. Curves defined by control lines are called control-line curves or plus curves, and surfaces defined by control planes are called control-plane surfaces or plus surfaces; the plus implies that in addition to the control points, gradient vectors at the control points are used to design curves and surfaces. The new curve and surface formulations provide more flexibility than traditional formulations in geometric design. Properties of plus curves and surfaces are investigated and an application of plus surfaces in smooth parametric representation of polygon meshes is introduced.     

A simple algorithm for designing developable Bézier surfaces

An algorithm is presented that generates developable Bézier surfaces through a Bézier curve of arbitrary degree and shape. The algorithm has two important advantages. No (nonlinear) characterizing equations have to be solved and the control of singular points is guaranteed. Further interpolation conditions can be met.     

有理q-Bernstein-Bézier曲线的构造及其应用

有理Bernstein-Bézier曲线在计算机辅助设计和计算机图形学上具有广泛的应用。在研究了经典的Bernstein-Bézier曲线及de Casteljau算法的基础上,结合q-Bernstein多项式,给出了有理q-Bernstein-Bézier曲线的构造方法、性质和计算有理曲线的de Casteljau算法,并讨论了曲线的细分和升阶的方法,通过改变q的取值,可以获得有理曲线族,在曲线造型上具有较强的灵活性。最后通过表示圆锥曲线和数字图像插值证明有理q-Bernstein-Bézier曲线的推广是有效的。     

An improved condition for the convexity of Bernstein-Bézier surfaces over triangles

A sufficient condition which is superior to that of Chang and Davis for the convexity of the Bernstein-Bézier polynomials of degree n over triangles is presented. The condition is proved to be necessary also for n = 2 and n = 3.     

An improved rendering technique for ray tracing Bézier and B‐spline surfaces

Both numerical and subdivision methods are widely used approaches for ray tracing parametric surfaces. However, the expense of finding the ray–surface intersection points is a major drawback. Thus, simpler and less memory‐intensive strategies are needed to improve these methods without further complicating them. This work presents an efficient algorithm for enhancing the performance of both numerical and subdivision methods. The proposed technique can be extended to most applications based on these two methods. The computational time of both approaches is improved by 16–40%. Copyright © 2000 John Wiley & Sons, Ltd.     

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

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

Curvature of singular Bézier curves and surfaces

This paper presents a general approach for finding the limit curvature at a singular endpoint of a rational Bézier curve and the singular corner of a rational Bézier surface patch. Conditions for finite Gaussian and mean limit curvatures are expressed in terms of the rank of a matrix.     

A projective invariant generalization of the de Casteljau algorithm

A projective invariant generalization of the de Casteljau algorithm is described by using the cross ratio and an auxiliary line. We describe the implicit form of the section conics obtained by the algorithm proposed in this paper. Finally, we show how to construct specific conic sections using this approach.     

Poisson曲线的递推求值

计算Bézier曲线上一点的DeCasteljau递推算法和计算B样条曲线上一点的DeBoor递推算法是计算机辅助几何设计(CAGD)领域里的两个经典算法。它们使得计算曲线上一点变得直观和快捷,非常适合用计算机编程实现。文章对Poisson曲线进行了研究,在上述算法的基础上,提出了计算Poisson曲线上一点的递推算法,并将其推广到有理Poisson曲线的情形,提出了有理Poisson曲线的递推算法。     

Modeling on triangulations with geodesic curves

This paper discusses the problem of modeling on triangulated surfaces with geodesic curves. In the first part of the paper we define a new class of curves, called geodesic Bézier curves, that are suitable for modeling on manifold triangulations. As a natural generalization of Bézier curves, the new curves are as smooth as possible. In the second part we discuss the construction of C ⁰ and C ¹ piecewise Bézier splines. We also describe how to perform editing operations, such as trimming, using these curves. Special care is taken to achieve interactive rates for modeling tasks. The third part is devoted to the definition and study of convex sets on triangulated surfaces. We derive the convex hull property of geodesic Bézier curves.

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

Lupa?q-Bézier曲线是一种以q-整数作为形状参数的广义Bézier曲线.本文构造了Lupa?q-Bézier曲线的一种新型几何求值算法,该算法倒数第二层2个节点的仿射组合与曲线相切.利用算法的相切性质得到Lupa?q-Bézier曲线导矢的一种新表示,并实现了Lupa?q-Bézier曲线的细分.特别地,二次...     

自由曲线曲面的任意次非均匀细分

提出一种有效的建模自由曲线曲面的非均匀细分算法。首先在节点插入技术基础上推导出任意次自由曲线的非均匀细分规则,然后把它推广到张量积曲面得到任意次自由曲面的非均匀细分规则,最后对奇异点附近曲面采用类Doo-Sabin和Catmull-Clark的细分规则,从而使该算法可以实现建模任意次具有任意拓扑基网格的非均匀细分曲面。此外,该方法也实现了对传统细分格式的统一,例如,当次数为2并采用均匀节点矢量便转化为Doo-Sabin细分,当次数为3并采用均匀节点矢量便转化为Catmull-Clark细分。     

Computation of the minimum distance between two Bézier curves/surfaces

We present an efficient and robust method based on the culling approach for computing the minimum distance between two Bézier curves or Bézier surfaces. Our contribution is a novel dynamic subdivision scheme that enables our method to converge faster than previous methods based on binary subdivision.     

Periodic Bézier curves

We construct closed trigonometric curves in a Bézier-like fashion. A closed control polygon defines the curves, and the control points exert a push-pull effect on the curve. The representation of circles and derived curves turns out to be surprisingly simple. Fourier and Bézier coefficients of a curve relate via Discrete Fourier Transform (DFT). As a consequence, DFT also applies to several operations, including parameter shift, successive differentiation and degree-elevation. This Bézier model is a particular instance of a general periodic scheme, where radial basis functions are generated as translates of a symmetric function. In addition to Bézier-like approximation, such a periodic scheme subsumes trigonometric Lagrange interpolation. The change of basis between Bézier and Lagrange proceeds via DFT too, which can be applied to sample the curve at regularly spaced parameter values. The Bézier curve defined by certain control points is a low-pass filtered version of the Lagrange curve interpolating the same set of points.     

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

提出了Bézier样条曲线利用分割技术近似弧长参数化的一种方法，并给出了相应的算法。通过求出曲线上所谓的‘最坏点’并在相应点处进行分割。可得到两条Bézier样条曲线。让这两条Bézier样条曲线具有与它们的近似弧长成比例的权，并对所得到的新的Bézier样条曲线进行同样的工作最终可得到一条由多条Bézier样条曲线所构成的新曲线。将这多条Bézier样条曲线合并成为一条Bézier样条曲线并通过节点插入技术将所得Bézier样条曲线转化为B一样条曲线的形式可得到全局参数域，其中各条Bézier曲线在全局参数域中所占子区间的长度与它们的权成比例，这样使得到了一条近似弧长参数化曲线。     

Characterizing degrees of freedom for geometric design of developable composite Bézier surfaces

This paper studies geometric design of developable composite Bézier surfaces from two boundary curves. The number of degrees of freedom (DOF) is characterized for the surface design by deriving and counting the developability constraints imposed on the surface control points. With a first boundary curve freely chosen, (2m+3), (m+4), and five DOFs are available for a second boundary curve of a developable composite Bézier surface that is G⁰, G¹, and G², respectively, and consists of m consecutive patches, regardless of the surface degree. There remain five and (7-2m) DOFs for the surface with C¹ and C² continuity. Allowing the end control points to superimpose produces Degenerated triangular patches with four and three DOFs left, when the end ruling vanishes on one and both sides, respectively. Examples are illustrated to demonstrate various design methods for each continuity condition. The construction of a yacht hull with a patterned sheet of paper unrolled from 3D developable surfaces validates practicality of these methods in complex shape design. This work serves as a theoretical foundation for applications of developable composite Bézier surfaces in product design and manufacturing.     

Tool path generation for free form surfaces using Bézier curves/surfaces

Presented in this paper is a tool path generation method for multi-axis machining of free-form surfaces using Bézier curves and surfaces. The tool path generation includes two core steps. First is the forward-step function that determines the maximum distance, called forward step, between two cutter contact (CC) points with a given tolerance. The second component is the side step function which determines the maximum distance, called side step, between two adjacent tool paths with a given scallop height. Using the Bézier curves and surfaces, we generate cutter contact (CC) points for free-form surfaces and cutter location (CL) data files for post processing. Several parts are machined using a multi-axis milling machine. As part of the validation process, the tool paths generated from Bézier curves and surfaces are analyzed to compare the machined part and the desired part.     

曲线插值的一种具有还圆性的细分方法

传统的线性四点插值细分方法不能表示圆等非多项式曲线,为了解决这种 问题,基于几何特性提出了一种带有一个参数的四点插值型曲线细分方法。细分过程中,过 相邻三插值点作圆,过相邻二插值点的圆弧有两个中点,将其加权平均得到新插值点,文中 给出了插值公式和算法描述。所给方法具有还圆性,可以实现保凸性。实例分析对比了本方 法与多种细分方法的差异,说明本方法是有效的,当参数取值较小时,曲线靠近控制多边形。