一种trimmedNURBS曲面的裁剪方法

所研究trimmed NURBS曲面的裁剪方法分三步完成裁剪算法。其主要特点是将所有trimmed NURBS曲面与裁剪轮廓面的交线都转为封闭环,从而可以统一的方式处理各类裁剪问题。实验结果表明,该算法可方便地解决目前一些曲面造型系统对已裁剪的内部和外部边界无法再裁剪等问题,亦可应用于一般形式的trimmed参数曲面的裁剪操作。     

基于球面三角网格逼近的等距曲面逼近算法

给出了一种基于球面三角网格逼近的等距曲面逼近新算法。利用三角网格逼近基球面,然后计算此三角网格按中心沿在曲面扫凉而成空间区域的边界作为等距曲面的逼近。该算法计算简单,方便地解决了整体误差问题,而且所得到的逼近曲面是与原曲面同次数的NURBS曲面。     

曲面离散跟踪求交算法的研究

跟踪求交是参数曲面求交常用的算法,而对于离散化的曲面也可以采用类似的方法。笔者提出的离散化跟踪求交是用离散方法求出交线上的某一个交点,然后根据两相交小三角面片的空间几何关系确定该交线段的方向。依次用跟踪法求出整条交线,这样就有效地避免了用离散法求交线不连贯的问题。     

RCS计算中NURBS曲面和射线求交的快速计算

提出了一种基于牛顿迭代法解方程组的射线和NURBS曲面求交算法。利用预先计算射线和曲面交点个数最大值,通过折中适应性分割曲面得到迭代初始值,达到了快速计算的效果。同时,解决了射线与NURBS曲面多交点判断、自交点筛选等问题,保证了交点精度,且不会遗漏交点。     

参数曲面与平面求交的一种新方法

本文提出了一种新的参数曲面与平面求交算法，基于平面的半空间性质，通过参数域平面的二向线性插值，将求交问题转化为一系列简单的离散、判断、比较、排序等运算，能较好的解决曲面片内的交线不连续和交线丢失问题，算法简便，可靠性好，计算精度高，在ＮＣ自动编程中具有广泛的应用场合。     

逆向工程中NURBS曲面与直线交点快速计算

给出了一个能够方便地判断NURBS曲面片与空间直线的交点个数,并且超线性收敛的快速迭代算法。计算Krawczyk算子判断给定的NURBS曲面片和空间直线有无交点和有几个交点。再使用拟牛顿迭代法求出NURBS曲面片和空间直线上的交点。该算法在用点云数据检测曲面重构的误差时具有快速、准确的特点。     

NURBS曲面自由型特征处理方法研究

NURBS曲面自由型特征因不具有确定的参数、准确的边界,使其表示、编辑及操作十分困难.基于一种新的小波多分辨率分析技术将NURBS曲面从单一尺度几何表示的空域变换为频域的表示形式,借助于滤波器组将模型的整体结构和局部细节变换为其全局和局部多分辨率自由型特征,实现了对NURBS曲面的自由型特征的编辑、操作和控制.该方法不仅能提高NURBS曲面几何建模的效率,而且可以克服传统NURBS曲面建模的繁琐和费时.     

二次椭圆曲面平截线实形的新方法

本文重点研究二次椭圆曲面与平面相交，求交线实形的方法。该方法的关键在于给定的条件利用作辅助曲面耿定出交已知曲面所截得的新投影面投影成圆，以定出交线实形上的点。     

参数曲面点元离散求交法

提出了一种基于点元的参数曲面求交交互式新算法。该算法在参数曲面上进行自适应的离散点元采样,将点元组织为空间八叉树结构进行求交运算,最后进行交点排序并得到最终的求交结果。与以往的参数曲面求交方法相比,本算法更简单高效。实验结果表明,本算法稳定可靠,误差可控,而且可以达到交互速度。     

基于递归分割的曲面造型算法

对常用复杂曲面造型方法的缺点进行了分析，给出了基于递归分割构造任意拓扑结构复杂曲面的有关算法，避免了参数方法在构造复杂曲面时费时而且难于处理的参数曲面求交和曲面拼接等问题，为优质高效建立复杂曲面模型奠定了基础。     

CAD/CAM中曲面求交技术的研究

提出了用几何特征量来描述二次曲面和相关的边界曲线的方法，并据此研究了求交算法，避免了代数法中频繁的坐标变换，减少了浮点运算误差出现的几率，简化了曲面求交算法，使曲面求交算法更加稳定可靠。     

一种直线与隐式曲面求交的方法

绘制隐式曲面的光线跟踪算法,其本质问题就是直线与隐式曲面的求交,区间算术求根方法是计算直线与隐式曲面的一个很好方法。本文介绍了区间算术原理,研究了区间算术在直线与隐式曲面求交的应用,给出了相应的算法。应用区间算术,不仅可以求出直线与隐式曲面的最近交点,而且能求出所有交点。     

Automatic mesh generation over intersecting surfaces

A fully automatic general scheme is proposed to determine and analyse the intersections between two groups of surfaces composed of triangular facets. By carefully maintaining the spatial position of the lines of intersection in regenerating mesh locally around surface intersections, pieces of surfaces can be arbitrarily combined and merged. A great variety of objects can be easily created by selectively putting together different surface parts derived from surface intersections. The new algorithm is best applied in conjunction with an existing surface mesh generator to enhance its general capability in dealing with objects built from intersecting surfaces. In fact, it is a powerful surface mesh manipulator, and through the repeated use of the process, complex structures can be rapidly and accurately constructed.     

Automatic merging of tetrahedral meshes

A generic algorithm is proposed to merge arbitrary solid tetrahedral meshes automatically into one single valid finite element mesh. The intersection segments in the form of distinct nonoverlapping loops between the boundary surfaces of the given solid objects are determined by the robust neighbor tracing technique. Each intersected triangle on the boundary surface will be triangulated to incorporate the intersection segments onto the boundary surface of the objects. The tetrahedra on the boundary surface associated with the intersected triangular facets are each divided into as many tetrahedra as the number of subtriangles on the triangulated facet. There is a natural partition of the boundary surfaces of the solid objects by the intersection loops into a number of zones. Volumes of intersection can now be identified by collected bounding surfaces from the surface patches of the partition. Whereas mesh compatibility has already been established on the boundary of the solid objects, mesh compatibility has yet to be restored on the bounding surfaces of the regions of intersection. Tetrahedra intersected by the cut surfaces are removed, and new tetrahedra can be generated to fill the volumes bounded by the cut surfaces and the portion of cavity boundary connected to the cut surfaces to restore mesh compatibility at the cut surfaces. Upon restoring compatibility on the bounding surfaces of the regions of intersection, the objects are ready to be merged together as all regions of intersection can be detached freely from the objects. All operations, besides the determination of intersections structurally in the form of loops, are virtually topological, and no parameter and tolerance is needed in the entire merging process. Examples are presented to show the steps and the details of the mesh merging procedure. Copyright © 2012 John Wiley & Sons, Ltd.     

矩形管双焦点不对称翻领成型器曲面研究

研究了矩形管双焦点不对称翻领成型器领口交接曲线和曲面的形成,建立了矩形管双焦点不对称翻领成型器的肩曲面及其边界曲线的数学模型,给出了其高度与其它参数的关系式,为矩形管双焦点不对称翻领成型器的CAD/CAM提供了数学理论依据.     

A feature‐preserving volumetric technique to merge surface triangulations

Several extensions and improvements to surface merging procedures based on the extraction of iso‐surfaces from a distance map defined on an adaptive background grid are presented. The main objective is to extend the application of these algorithms to surfaces with sharp edges and corners. In order to deal with objects of different length scales, the initial background grids are created using a Delaunay triangulation method and local voxelizations. A point enrichment technique that introduces points into the background grid along detected surface features such as ridges is used to ensure that these features are preserved in the final merged surface. The surface merging methodology is extended to include other Boolean operations between surface triangulations. The iso‐surface extraction algorithms are modified to obtain the correct iso‐surface for multi‐component objects. The procedures are demonstrated with various examples, ranging from simple geometrical entities to complex engineering applications. The present algorithms allow realistic modelling of a large number of complex engineering geometries using overlapping components defined discretely, i.e. via surface triangulations. This capability is very useful for grid generation starting from data originated in measurements or images. Copyright © 2002 John Wiley & Sons, Ltd.     

圆形管截面全锥面翻领成型器及其数学模型研究

提出了全锥面翻领成型器的基本思想,分析了其优缺点,并对其数学模型进行了详细研究,包括领口交接曲线、肩曲面、边界曲线。在计算机上对所建模型进行了Pro/E三维仿真验证。为正确设计圆形管全锥面翻领成型器提供理论依据。     

圆形偏置翻领成型器的研究

研究了用于立式制袋-充填-封口机的圆形偏置翻领成型器.提出了用两个传统圆形截面翻领成型器进行组合的制作方法,并给出了圆形偏置翻领成型器的交接曲线及边界曲线方程,建立了数学模型.为圆形偏置翻领成型器的加工制作提供了理论依据.     

图形系统中实用椭圆求交快速算法的研究和实现

分析了一般椭圆求交算法的缺点,提出了一种便于在计算机上实现的实用椭圆求交算法,利用该算法简化了求解的复杂过程并防止了丢失有效交点的现象。