The Geometric Continuity of Rational Bezler Triangular Surfaces

The problems of geometric continuity for rational Bezter surfaces are discussed. Concise conditionsof first order and second order geometric continuity for rational triangular Bézier surfaces are given.Meanwhile,a geometric condition for smoothness between adjacent rational Bézier surfaces andthe transformation formulae between rational triangular patches and rational rectangular patches areobtained.     

Geometric Modelling by Recursively Cutting Vertices

In this paper,a new method for curve and surface modelling is introduced which generates curves and surfaces by recursively cutting and grinding polygons and polyhedra.It is a generalization of the existing corner-cutting methods.A lot of properties,such as geometric continuity,representation,shape-preserving,and the algorithm are studied which show that such curves and surfaces are suitable for geometric designs in CAD,computer graphics and their application fields.     

A Subdivision Scheme for Rational Triangular Bézier Surfaces

An explicit formula is developed to decompose a rational triangular Bezier patch into three non-degenerate rational rectangular Bezier patches of the same degree.This formula yields a stable algorithm to compute the control vertices of those three rectangular subpatches.Some properties of the subdivision are discussed and the formula is illustrated with an example.     

Fast Ray Tracing NURBS Surfaces

In this paper,a new algorithm wit extrapolation process for computing the ray/surface intersection is presented.Also,a ray is defined to be the intersection of two planes,which are non-orthogonal in general,in such a way that the number of multiplication operations is reduced.In the preprocessing step,NURBS surfaces are subdivded adaptively into rational Bezier patches.Parallelepipeds are used to enclose the respective patches as tightly as possible Therefore,for each ray that hits the enclosure(i.e.,parallelepiped)of a patch the intersection points with the parallelepiped‘s faces can be used to yield a good starting point for the following iteration.The improved Newton iteration with extrapolation process saves CPU time by reducing the number of iteration steps.The intersection scheme is facter than previous methods for which published performance data allow reliable comparison.The method may also be used to speed up tracing the intersection of two parametric surfaces and oter operations that need Newton iteration.     

A novel algorithm for explicit optimal multi-degree reduction of triangular surfaces

This paper introduces the algebraic property of bivariate orthonormal Jacobi polynomials into geometric approximation. Based on the latest results on the transformation formulae between bivariate Bernstein polynomials and Jacobi polynomials, we naturally deduce a novel algorithm for multi-degree reduction of triangular B~zier surfaces. This algorithm possesses four characteristics： ability of error forecast, explicit expression, less time consumption, and best precision. That is, firstly, whether there exists a multi-degree reduced surface within a prescribed tolerance is judged beforehand; secondly, all the operations of multi-degree reduction are just to multiply the column vector generated by sorting the series of the control points of the original surface in lexicographic order by a matrix; thirdly, this matrix can be computed at one time and stored in an array before processing degree reduction; fourthly, the multi-degree reduced surface achieves an optimal approximation in the norm L2. Some numerical experiments are presented to validate the effectiveness of this algorithm, and to show that the algorithm is applicable to information processing of products in CAD system.     

C~2-(C~3-) Continuous Interpolation Spline Curve and Surface

Free-formed or sculptured surfaces in engineering products are frequently constructed from a set of measured 3D data points.C^2-(C^3-)continuity approach is important in this field.This paper presents a method of rectangular interpolation of given 3D data array which is regularly arranged.The interpolation surface which is constructed by tensor product has dsirable properties(second-order or third-order continuity,locality)and is implemented and adjusted easily,Higher order continuity methods are also briefly discussed.     

Surface Modelling and Mesh Generation for Simulating Superplastic Forming

This paper presents an approach which enables surface modelling, mesh generation and the Finite Element (FE) analysis to be integrated together to simulate superplastic forming process for complex shaped components. Techniques have been developed to generate an FE mesh over non-four-sided surface areas, the boundaries of which are Bezier curves of arbitrary degree, using a consistent expression. Theoretical evidence is given to determine the number of Bezier triangular patches required for accurately re-constructing die surfaces within a commercial FE solver. The developed techniques have been successfully used in determining the process parameters for forming a 3D rectangular box.     

Advanced Geometric Modeler with Hybrid Representation

An advanced geometric modeler GEMS4.0 has been developed,in which feature representation is used at the highest level abstraction of a product model.Boundary representation is used at the bottom level,while CSG model is adopted at the median level.A BRep data structure capable of modeling non-manifold is adopted.UNRBS representation is used for all curved surfaces,Quadric surfaces have dual representations consisting of their geometric data such as radius,center point,and center axis.Boundary representation of free form surfaces is easily built by sweeping and skinning method with NURBS geometry.Set operations on curved solids with boundary representation are performed by an evaluation process consisting of four steps.A file exchange facility is provided for the conversion between product data described by STEP and product information generated by GEMS4.0.     

A Radiosity Solution for Curved Surface Environments

Radiosity has been a popular method for photorealistic image generation.But the determination of form factors between curved patches is the most difficult and time consuming procedure,and also the errors caused by approximating source patch‘s radiosity with average values are obvious.In this paper,a radiosity algorithm for rendering curved surfaces represented by parameters is described.The contributed radiosity from differential areas on four vertices of the source patch to a receiving point is calculated firstly,then the contribution from the inner area of the source patch is evaluated by interpolating the values on four corners.Both the difficult problem of determining form-factors between curved surfaces and errors mentioned above have been avoided.Comparison of the experimental results using the new algorithm has been made with the ones obtained by traditional method.Some associated techniques such as the visibility test and the adaptive subdivision are also described.     

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.     

G1连续几何偏微分方程Bézier曲面的构造

基于三角形和四边形网格上Laplace-Beltrami算子、高斯曲率和平均曲率的离散及其收敛性分析,提出了一种使用四阶几何流构造几何偏微分方程Bézier曲面的方法.使用该方法构造出的Bézier曲面既具有几何偏微分方程曲面的最优性质,同时又满足G1连续性.算法收敛性的数值实验表明该方法是有效的.     

三角Bézier曲面的几何约束形变

利用三角Bézier曲面的矩阵表达形式,把几何约束下的形状调整算法从曲线和张量积曲面推广到三角Bézier曲面,使得三角Bézier曲面在形变后既能保持外形大致不变,又能满足一系列事先指定的几何约束(点约束和法向约束).利用Lagange乘子法,几何约束形变的条件极值问题被转化为线性方程组的求解问题,以便于快速计算.特别地,三角Bézier曲面在形变前后还可以满足边界曲线在角点处保持(Ca,Cb,Cc)连续.数值实例表明,该算法简单有效,便于CAD(计算机辅助设计)系统进行交互.     

Bézier曲面的函数复合及其应用

目前有两种常用的Bézier曲面片,分别称为三角和四边Bézier曲面片,它们分别用不同的基函数表示.本文通过移位算子和函数复合的方法,得到了两个关于这两种Bézier曲面片的结果.一个是四边Bézier曲面片与一次三角Bézier函数的复合,另一个是三角Bézier曲面片与双线性四边Bézier函数的复合.在每一种情况中,复合所得到的Bézier曲面片的控制顶点是原来Bézier曲面片的控制顶点的线性组合.移位算子的应用使得相应的推导过程变得简洁和直观.这两个结果的应用包括：两种Bézier面片间的转化     

Rational parameterization of quadrics and their offsets

In this paper, we study two problems related to quadrics. One is the representation of triangular and quadrangular patches on quadrics: a necessary and sufficient condition is given for triangular patches on quadrics to be representable as rational quadratic triangular Bézier surfaces. The other is the rationality of the offsets to quadrics: the offsets of regular quadrics are shown to be rational and the algorithms are given for computing their rational parameterizations.     

GC^1约束的三角Bézier曲面降阶逼近研究

研究给定的n次三角Bézier曲面在L2范数下的一次降多阶的逼近问题,给出了在无约束条件下的三角Bézier曲面降阶求解的详细过程,将降阶问题转化为非线性最优化问题求解,并将降阶过程与曲面的几何连续拼接结合在一起,给出了降阶同时满足GC^1拼接的实现过程。实验结果表明,该方法简单实用,降阶逼近效果好。     

基于多分辨率模型的三角曲面特征线辨识技术

由于特征线在反求工程 CAD建模中具有非常重要的作用 ,因此利用图形图象处理中的多分辨率模型概念 ,通过研究三角曲面模型的特征线 ,提出了一种三角曲面特征线的计算方法 .将计算得到的初始特征线通过编辑、修改等手段进行处理 ,得到清晰的特征线 ,并将其作为进一步划分重构 B样条曲面边界的依据和参考 ,从而为实现基于三角曲面模型的 B样条曲面重构奠定了基础 .实验结果证明 ,该算法能够在三角曲面上提取出令人满意的特征线 ,并据此重构出拓扑划分合理的 B样条曲面 .     

Fair Surface Reconstruction Using Quadratic Functionals

An algorithm for surface reconstruction from a polyhedron with arbitrary topology consisting of triangular faces is presented. The first variant of the algorithm constructs a curve network consisting of cubic Bézier curves meeting with tangent plane continuity at the vertices. This curve network is extended to a smooth surface by replacing each of the networks facets with a split patch consisting of three triangular Bézier patches. The remaining degrees of freedom of the curve network and the split patches are determined by minimizing a quadratic functional. This optimization process works either for the curve network and the split patches separately or in one simultaneous step. The second variant of our algorithm is based on the construction of an optimized curve network with higher continuity. Examples demonstrate the quality of the different methods.     

A generalization of the Bernstein-Bézier method

A representation for parametric curves and surfaces is presented which generalizes the scheme of the nonrational Bézier curve and surface by introducing appropriate parameters into the parametric forms. A brief discussion of the continuity conditions and a comparison with the rational Bézier curve and surface are included.     

Bézier curves and surfaces with shape parameters

Bézier curves with n shape parameters and triangular Bézier surfaces with 3n(n+1)/2 shape parameters are presented in this paper. The geometric significance of the shape parameters and the geometric properties of these curves and surfaces are discussed. The shapes of the curves and the surfaces can be modified intuitively, foreseeably and precisely by changing the values of the shape parameters.