三角网格模型的特征线提取

在反求工程中，散乱数据点云的曲面重构常采用三角网格模型，若将其转换成曲面实体模型则有更广泛的应用，从三角网格模型中提取特征线是转换过程中的重要步骤．在讨论反求工程中数据点云分块方法的基础上，采取“基于边”的方法来提取特征线：先提取特征点，再连接成特征线．根据相邻三角片的法矢夹角和各点主曲率是否为极值，分两次提取特征点，利用三角顶点加权和均匀化等方法减少狭长三角片对特征点提取的计算误差影响，再将特征点分组连接成B样条曲线．文中算法的结果可为B样条曲面分片拟合和建立B-rep曲面实体模型提供依据。     

平面向量场与曲率分析在曲面求交中的应用

在曲面求交算法中，初始跟踪点的确定和交线分支的跟踪是最关键的两个问题．本文总结了用平面向量场确定初始跟踪点的算法，给出了使用曲率分析精确计算跟踪方向，并估计跟踪步长的方法．应用平面向量场和曲率分析，作者实现了高效可靠的ＮＵＲＢＳ曲面求交算法．     

复杂曲面局部协调设计技术

综合利用CAGD中的曲线曲面理论和方法,通过构造合理的局部区域来裁剪N边汇交曲面,并利用汇交曲面的原始信息解决局部NURBS曲面的协调设计．该方法在新生成曲面与裁剪汇交曲面之间保证处处G^1连续,同时光滑地逼近于局部区域的特征走向．这种基于特征敏感的带复杂边界条件约束的协调曲面重构方法,作为曲面高级编辑工具已应用于计算机辅助反求工程CAD软件RE—SOFTV6．0中．实际应用表明,局部协调设计技术能够较好地解决复杂曲面造型和反求工程建模中模型的整体连续性和保形性．     

运动曲面求交优化算法

运动曲面求交通常采用曲面求交算法，通过反复迭代求取曲面交线，没有考虑运动曲面自身的特性进行求交简化．由于运动曲面不同运动瞬间的曲面交线之间存在必然联系，因此通过对曲面内在属性分析，提出了运用运动曲面不同运动瞬间曲面交线相似性进行运动曲面求交的优化算法．首先对两个运动曲面的基曲面进行预处理。获取表征曲面交线拓扑的特征点；根据特征点分布图确定不同运动瞬间曲面交线起始点搜索策略，采用跟踪法动态调整步长和跟踪方向求解整个交线环．采用文中方法可以有效地解决运动曲面的子环、奇点遗漏、分支跳跃、乱序跟踪和初始点求取问题，精确、鲁棒、快速地计算出交线．     

求NURBS自由曲面的等值线─—一种基于极值点的追踪方法

复杂自由曲面的等值线是刻划曲面几何形状的特征线簇之一，有助于可视化建模过程评估其数学物理模型．本文提出一种基于极值点求追踪始点的方法，对Ｓ．Ｇ．Ｓａｔｔｅｒｆｉｅｌｄ的求等值线方法做了重要改进．对ＮＵＲＢＳ曲面片的边界上的极值点及曲面片内的极值点进行扫描分析，可快速地求出全部等值线的切矢追踪始点，从而避免了百目搜索和重复追踪．此算法具有严格的理论分析，能保证正确性，具有一般应用价值．     

反求工程中扫描曲面特征的提取

根据扫描曲面的定义，本文提出了一种基于点云切片数据的扫描曲面特征的提取方法。首先，由平行且过扫描面特征的切片点云数据获取扫描轨迹曲线；接着，由垂直于扫描轨迹线的切片点云数据获得截面轮廓线；最后，由扫描轨迹曲线和截面轮廓线即可确定扫描面特征。本文算法已在UG／OPEN上实现，并用实例证明了该方法的正确性和可行性
性。     

器官反求CAD建模中的虚拟测量

针对基于断层轮廓数据反求CAD建模中曲面品质较差的问题，提出一种基于复合三角Bezier曲面的局部虚拟测量方法。首先分离品质较差的局部曲面，然后拟合局部曲面的散乱点得到光顺的中间曲面模型，最后将中间曲面离散得到修正的曲面模型。算例表明，利用局部虚拟测量方法可以明显提高器官重构曲面模型的品质。该方法也可以用于改善零件反求CAD中曲面局部特征的品质。     

人体局部曲面建模与自由变形方法

人体曲面建模与自由变形方法是实现人体数字化的关键技术。给出了提取平面点云数据的方法及平面点云排序算法，介绍了基于平面数据的B样条曲面重构算法，重点叙述了用FFD（Free Form Deformation）技术实现曲面变形的算法及自由变形方法的特点，最后给出了人体胸部曲面建模与自由变形的实例，实例表明使用FFD进行曲面变形的效果比较自然。     

求NURBS自由曲面的等值线：一种基于极值点的追踪方法

复杂自由曲面的等线是刻划曲面几何形状的特征线簇之一，有助于可视化建模过程评估其数学物理模型。本文提出一种基于极值点求追踪始点的方法，对Ｓ．Ｇ．Ｓａｔｒｔｅｒｆｉｅｌｄ的求等值线方法做了重要改进。     

复合三角Bèzier曲面的裁剪

利用三角Ｂèｚｉｅｒ曲面片的保凸性和可分割性,解决了初始交点计算、迭代收敛等问题;通过求近曲面点、边界点跨越等过程,由一个初始交点出发跟踪计算跨越许多曲面片的整条交线;将各交点作为型值点插入曲面中,对三角网格进行局域三角化,以交线为界限进行分离,重新生成两张复合曲面,实现了裁剪的目的;基于次边界环和重新分布边界点的计算,改善了狭长三角形对整张曲面的性态影响．测试显示,上述方法简单可靠,满足了反求工程ＣＡＤ建模的要求     

Blending Quadric Surfaces with Piecewise Algebraic Surfaces

Given several algebraic surfaces and corresponding auxiliary planes, a scheme for constructing a piecewise algebraic surface to blend the given surfaces is presented along the intersection curves of the given surfaces and their corresponding auxiliary planes. The algorithm starts with the suitable partition of the 3D space into tetrahedrons or prisms in which the algebraic surface patches are defined. Then a smooth piecewise algebraic surface of low degree is constructed which meets the initial surfaces with a certain order of geometric continuity. Examples are provided to demonstrate the detailed construction process and to compare our method with previous approaches. The results show some advantages of the new blending method.     

Visualizing nonmanifold and singular implicit surfaces with point clouds

We use octree spatial subdivision to generate point clouds on complex nonmanifold implicit surfaces in order to visualize them. The new spatial subdivision scheme only uses point sampling and an interval exclusion test. The algorithm includes a test for pruning the resulting plotting nodes so that only points in the closest nodes to the surface are used in rendering. This algorithm results in improved image quality compared to the naive use of intervals or affine arithmetic when rendering implicit surfaces, particularly in regions of high curvature. We discuss and compare CPU and GPU versions of the algorithm. We can now render nonmanifold features such as rays, ray-like tubes, cusps, ridges, thin sections that are at arbitrary angles to the octree node edges, and singular points located within plot nodes, all without artifacts. Our previous algorithm could not render these without severe aliasing. The algorithm can render the self-intersection curves of implicit surfaces by exploiting the fact that surfaces are singular where they self-intersect. It can also render the intersection curves of two implicit surfaces. We present new image space and object space algorithms for rendering these intersection curves as contours on one of the surfaces. These algorithms are better at rendering high curvature contours than our previous algorithms. To demonstrate the robustness of the node pruning algorithm we render a number of complex implicit surfaces such as high order polynomial surfaces and Gaussian curvature surfaces. We also compare the algorithm with ray casting interms of speed and image quality. For the surfaces presented here, the point clouds can be computed in seconds to minutes on atypical Intel based PC. Once this is done, the surfaces can be rendered at much higher frame rates to allow some degree of interactive visualization.     

A unified algorithm for finding the intersection curve of surfaces

In this papaer,an INTEGRAL CURVE ALGORITHM is presented,which turns the intersection curve of surfaces into the form of integral one and then uses “PREDICTORCORRECTOR” technique to evaluate the intersection of surfaces.No matter how the surfaces are defined,the method always deals with the intersection curves in the same way.To find a point on the curve one need only to calculate the JACOBI determinants of “PREDICTOR point”and “CORRECTOR point” while the second order precision is guatanteed.Thus,not only is the problem of finding the intersection of surfaces resolved,but also the algorithms for generating both plane curve and space curve are unified.     

Applications of power series in computational geometry

A number of algorithms are presented for obtaining power series expansions of curves and surfaces at a point. Some results on the radius of convergence are given. Two applications of series are given:

1. • for curve tracing algorithms, where a truncated series is used to approximate the curve of intersection of two surfaces

2. • to define nth degree geometric continuity, for arbitrary

曲面交线的B样条优化逼近

目前，在比较成熟的商业几何核心系统中，曲面的交线是一种基于位置算子的“精确”表示或称为“过程”表示．这样的交线如果用在几何建模操作中，必须输出为系统支持的曲线表示(如B样条表示)．现有的几何核心系统中曲面交线的B样条逼近算法存在控制点数目过多和连续性偏低(C^1)的缺点，导致下游操作结果太复杂且连续性低．基于此，提出了一种曲面交线的B样条逼近算法，使控制点数目减少为原来的三分之一，而连续阶上升为C^2．该算法已经在SolidWorks系统中得到应用，效果良好．     

三角网格上的代数曲面重建

提出一种用分片代数曲面构造三角曲面片的方法,利用具有公共边的2个三角形区域的4个顶点的函数值以及公共边2个端点的外法向量来构造一个二次曲面V(g)和一个截面V(h),其交V(g,h)即为2个三角曲面片的公共边界曲线.对每个已确定了边界条件的三角片内部进一步划分成3部分,每部分各自定义一个三次代数曲面.这3个三次代数曲面不仅在其交线处光滑拼接,而且分别沿三角形的边界与V(g)光滑拼接,从而构成一个具有GC1连续性的分片代数曲面.对于只属于一个三角片的边界留有一个自由度,可对曲面形状加以控制.     

快速成型中一种改进的轮廓线生成算法

在对STL模型分层求交线过程中,针对三角面片的边与切平面很接近时,浮点运算引起的精度损失可能导致的错误交线问题,提出一种基于STL模型局部拓扑的分层算法。将所有可能引起错误交线的三角面片提取出来,建立拓扑结构,以接近切平面的边在切平面的投影替代交线,消除了由于浮点运算误差导致的轮廓线缺边和重边的错误。实验结果表明,该算法在计算出交线段集后不需要再进行修复,简单连接后就能得出正确的切片轮廓线。     

Arc–surface intersection method to calculate cutter–workpiece engagements for generic cutter in five-axis milling

Calculating cutter–workpiece engagements (CWEs) is essential to the physical simulation of milling process that starts with the prediction of cutting forces. As for five-axis milling of free form surfaces, the calculation of CWEs remains a challenge due to the complicated and varying engagement geometries that occur between the cutter and the in-process workpiece. In this paper, a new arc–surface intersection method (ASIM) is proposed to obtain CWEs for generic cutter in five-axis milling. The cutter rotary surface is first represented by the family of section circles which are generated by slicing the cutter with planes perpendicular to the tool axis. Based on the envelope condition, two grazing points on each section circle are analytically derived, which divide the circle into two arcs. The feasible contact arc (FCA) is then extracted to intersect with workpiece surfaces. Using arc/surface intersection and distance fields based approach, the boundary of the closed CWEs is accurately and efficiently calculated. Compared with the solid modeler based method and the discrete method, the ASIM has higher computational efficiency and accuracy. Moreover, an analytical solution for calculating CWEs can be obtained with this method in five-axis milling of the workpiece merely comprising of flat and quadric surfaces. Finally, two case tests are implemented to confirm the validity of the ASIM and comparisons have been made with a Vericut based system which utilizes the Z-buffer method. The results indicate that the ASIM is computationally efficient, accurate and robust.     

三角形域上C1连续的四次插值曲面

提出了一种在三角形域上构造C^1曲面的方法，该方法构造的曲面片由4个曲面加权平均产生，在三角形的边界上满足给定的边界曲线和一阶跨界导数．所构造的曲面可看作由一张基本曲面和三张过渡曲面构成．用三条曲线相交于一点且在交点处共面作为约束条件构造基本曲面，在三角形的内部具有较好形状和逼近精度．同边点法相比，文中方法产生的曲面形状更好；且该方法产生的曲面对四次多项式曲面是精确的，因而比Nielson的点边方法具有更高的插值精度．