Loop细分曲面的等距曲面的逼近

提出了一种生成Loop细分曲面的等距曲面的逼近方法．通过让生成的等距曲面在对应于其控制网格顶点的地方是精确的等距，作者将等距曲面的逼近问题转化为求解一个线性方程组．文中提出了一个用于快速求解该线性方程组的改进的Gauss—Jacobi迭代法．另外，该文还考虑了逼近的误差控制和等距曲面的自交问题．     

基于C—C细分的四边形网格上插值光滑Bezier曲面的生成

在任意拓扑的四边形网格上构造光滑的曲面是计算机辅助几何设计中的一个重要问题．基于C—C细分,提出一种从四边形网格上生成插值网格顶点的光滑Bezier曲面片的算法．将输入四边形网格作为C—C细分的初始控制网格,在四边形网格的每张面上对应得到一张Bezier曲面,使Bezier曲面片逼近C—C细分极限曲面．曲面片在与奇异顶点相连的边界上G^1连续,其他地方C^2连续．为解决C—C细分的收缩问题,给出了基于误差控制的迭代扩张初始控制网格的方法,使从扩张后网格上生成的曲面插值于初始控制网格的顶点．实验结果表明,该算法效率高,生成的曲面具有较好的连续性,适用于对四边化后的网格模型上重建光滑的曲面．     

散乱数据点的细分曲面重建算法及实现

提出一种对海量散乱数据根据给定精度拟合出无需裁剪和拼接的、反映细节特征的、分片光滑的细分曲面算法．该算法的核心是基于细分的局部特性，通过对有特征的细分控制网格极限位置分析，按照拟合曲面与数据点的距离误差最小原则，对细分曲面控制网格循环进行调整、优化、特征识别、白适应细分等过程，使得细分曲面不断地逼近原始数据．实例表明：该算法不仅具有高效性、稳定性，同时构造出的细分曲面还较好地反映了原始数据的细节特征。     

Catmull-Clark细分曲面的形状调整

提出一种调整细分曲面形状的算法．该算法用cosα(Ck)取代C-B样条的形状因子α，并将Ck的定义区间从[-1，1]扩大到[-1，∞)；然后用这种扩展了的GB样条来构造catmull—clark细分曲面；使得生成细分曲面的形状不仅能够在C-B样条的范围内可调，而且还能在标准的catmull-clark细分曲面和初始的控制网格之间任意调整．该算法保留了C-B样条和catmull-clark细分曲面的主要特点，如精确表示圆柱体、处理任意拓扑结构的控制网格等。     

基于Catmull-Clark细分的曲面布尔运算基础研究

基于Catmull-Clark细分,提出一种对平面四边型网格进行操作的基础布尔运算,包括曲面求交、裁剪和网格级基础布尔运算,首先将细分曲面的求交转换为对一定细分层次的细分控制网格求交,得到满足一定精度要求的交线;采用局部修改交点处的控制网格拓扑结构和控制网格顶点位置的方法,实现了对细分曲面的裁剪;最后提出一种对一定细分层次的四边形控制网格进行操作的布尔运算,称之为细分曲面网格级布尔运算,包括布尔交、布尔并和布尔差3种运算,并给出了运算的基本原则与应用实例.     

复杂曲面加工精度检验中曲面法矢与刀具扫描体求交算法的研究

提出了一种用于实现矢量与扫描体（代表五轴数控加工铣刀的运动）求交的有效算法,该算法首先对曲面法矢和刀具扫描体进行预处理,将曲面法矢与刀具扫描体之间的求交问题转化为有向线段与三角网格之间的求交计算,然后建立有向线段和三角网格的求交子集,减少了不必要的求交计算,提高了乍法的效率。文中举例说明了该算法在复杂曲面NC精度检验中的应用。     

误差可控的细分曲面图像矢量化EI北大核心CSCD

为了提高矢量化图像的重构质量,提出一种基于细分曲面的误差可控矢量化算法.首先提取图像特征,构建特征约束的初始网格,并利用二次误差度量方法简化初始网格,得到特征保持的基网格;然后利用带尖锐特征的Loop细分曲面拟合图像颜色,得到控制网格;最后计算重构图像的误差,对控制网格进行自适应细分,直至重构误差达到用户需求.实验结果表明,该算法能够大幅度提高初始重构结果的质量,并在一定程度上做到误差可控.     

基于四边形网格的可调细分曲面造型方法

提出了一种基于四边形网格的可调细分曲面造型方法。该方法不仅适合闭域拓扑结构，且对初始网格是开域的也能进行处理。细分算法中引入了可调参数，增加了曲面造型的灵活性。在给定初始数据的条件下，曲面造型时可以通过调节参数来控制极限曲面的形状。该方法可以生成C1连续的细分曲面。试验表明该方法生成光滑曲面是有效的。     

可调自适应三角网格的细分曲面造型方法

为了研究一种简单的有效的细分曲面方法使生成的曲面不仅光滑而且可调,提出了一种面向三角网格的可调自适应细分曲面造型法,该方法通过在传统的Loop细分模式中加入形状控制因子以使生成的曲面形状可调,同时引入二面角作为控制误差来判断相邻三角形夹角是否满足给定的阈值,以此实现自适应细分过程。模拟算例结果表明,该方法不仅能用较少网格获得性能良好的曲面,而且可以通过选取不同的值调整生成曲面形状,满足工程需要。     

测点数据生成刀具路径研究

为了提高反求加工的效率，提出由大规模测点数据直接生成粗、精加工刀具路径的算法．粗加工采用层切法分层切削材料，首先构造健壮的数据结构——层切网；然后计算无干涉刀位点，并把整个层切网划分为几个优化的子加工区域；最后应用优化的刀路链接法则得到粗加工刀具路径．精加工由大规模数据点构建三角曲面．为了避免干涉，需计算点、面和边的无干涉刀位点．实验结果表明，粗加工刀具路径算法具有较高的效率，只需要占用较小的内存空间；精加工可以成功地避免干涉并且获得可靠的表面精度．     

A Biorthogonal Wavelet Approach based on Dual Subdivision

In this paper a biorthogonal wavelet approach based on Doo‐Sabin subdivision is presented. In the dual subdivision like Doo‐Sabin scheme, all the old control vertices disappear after one subdivision step, which is a big challenge to the biorthogonal wavelet construction. In our approach, the barycenters of the V‐faces corresponding to the old vertices are selected as the vertices associated with the scaling functions to construct the scaling space. The lifting scheme is used to guarantee the fitting quality of the wavelet transform, and a local orthogonalization is introduced with a discrete inner product operation to improve the computation efficiency. Sharp feature modeling based on extended Doo‐Sabin subdivision rules is also discussed in the framework of our wavelet construction. The presented wavelet construction is proven to be stable and effective by the experimental results.     

基于Doo Sabin 细分的图像插值

图像插值是放大低分辨率图像以适应目标显示屏幕的一种重要方法。保持图像的几何特征是保证放大图像质量的一个有效途径。基于Doo Sabin细分,提出了一种新的图像插值方法。该方法首先通过一次映射关系获取高分辨图像的部分数据;然后根据高分辨率图像中未知像素点的几何特征将它们分类;再根据Doo Sabin细分方法由已知像素点插值出所有未知像素点。未知像素点的值是与最相关的邻近像素点的加权均值,加权策略根据像素点间的相对位置由Doo Sabin细分推演获得。实验证明,与现有插值方法相比,基于Doo Sabin细分的图像插值能够更好地保持上采样图像的边缘的尖锐特性,减少锯齿现象,获取高质量的高分辨率图像。     

基于混合子分方法的曲面网格顶点与法向插值

顶点位置和法向插值是参数曲面造型的重要内容,文中基于混合子分方法生成三次B样条控制网格,使得相应的三次B样条曲面插值初始网格中指定的顶点,并通过引入插值模板的概念,把法向的插值转化为对模板的旋转变换,使得曲面在不改变2插值顶点的情况下插值法向,最后得到一张C^2连续的插值指定顶点和法向的曲面,与传统的逐片Bezier或Coons曲面片构造方法相比,此方法更为简洁且具有更高的连续阶,而且易于推广到高阶B样条和任意拓扑情形,具有较强的实用性。     

二次B样条曲面顶点及法向插值

顶点位置插值是自由曲面造型的基本方法,法向插值在一些CAD／CAM系统中也有重要应用,文中利用子分曲面理论研究双二次B样条曲面的性质,在此基础上利用Doo-Sabin分子模式构造插值顶点位置和法向的双二次B样条曲面控制网络,得到插值曲面的参数表示,为了提高效率,对规模较大的网络数据,先把它成若干片子网格,分别求出满足子网格相关的插值条件的控制网格,最后再反它们整合在一起形成完整的控制网格,使得相应的二次B样条曲面插值所有顶点及法向。     

A new curve-based approach to polyhedral machining

This paper presents a new approach to three-axis NC tool path generation for sculptured surfaces. In the proposed curve-based approach, the gouge-free tool paths are generated from a polyhedral model of the STL (stereolithography) format. The polyhedral model is offset by a local-offsetting scheme. Then, the offset elements such as triangular facets, trimmed cylinders, and trimmed spheres are sliced by a series of drive planes. The curve segments on a drive plane are sorted, trimmed and linked, while the concave gouge is removed during the trimming process. The method is implemented on a PC, and some illustrative examples are provided in this paper. The main advantage of the proposed method is that the tool path can be generated from a polyhedral model without any concave and convex gouge, especially on an NC machine that supports NURBS interpolation. Other advantages and disadvantages of the proposed model are also discussed.     

Efficiently determining a locally exact shortest path on polyhedral surfaces

In this paper, we present an efficient visibility-based algorithm for determining a locally exact shortest path (LESP) from a source point to a destination point on a (triangulated) polyhedral surface. Our algorithm, of a finitely-iterative scheme, evolves an initial approximately shortest path into a LESP. During each iteration, we first compute the exact shortest path restricted on the current face sequence according to Fermat’s principle which affirms that light always follows the shortest optical path, and then optimize the face sequence where the path is not locally shortest on the polyhedral surface. Since the series of paths we obtained are monotonic decreasing in length, the algorithm gives a LESP which is shorter than the initial path, at conclusion.

For comparison, we use various methods to provide an initial path. One of the methods is Dijkstra’s algorithm, and the others are the Fast Marching Method (FMM) and its improved version. Our intention for improvement is to overcome the limitation of acute triangulations in the original version. To achieve this goal, we classify all the edges into seven types according to different wavefront propagation manners, and dynamically determine the type of each edge for controlling the subsequent wavefront expansion. Furthermore, we give two approaches for backtracing the approximately shortest paths directed at the improved FMM. One exploits the known propagation manners of the edges as well as the Euler’s method. This is another contribution in this paper.     

A subdivision algorithm for axisymmetric sections

In the generation of curved surfaces through a subdivision process, Sabin and Doo applied and extended Chaikin's algorithm to three dimensions by using linear combinations of the vertices of a polyhedron. A similar smoothing subdivision algorithm was brought out by Catmull and Clark. This paper describes an alternative algorithm which uses a similar approach but applies to sections of axisymmetric objects. It shows that axisymmetric free-formed surfaces can be generated easily and effeciently.     

Interference-free tool-path generation in the NC machining of parametric compound surfaces

A method is presented for generating interference-free tool paths from parametric compound surfaces. A parametric compound surface is a surface that consists of parametric surface elements. The method is largely composed of two steps: points are obtained from a compound surface to be converted into a triangular polyhedron; tool paths are then generated from the polyhedron. An efficient algorithm is used in the calculation of cutter-location data, and planar tool paths, which are suitable for metal cutting, are produced. The time taken to obtain all the tool paths from a surface model that consists of a large number of parametric surfaces is short. Some real applications are presented.     

Point-augmented biquadratic C1 subdivision surfaces

Shape artifacts, especially for convex input polyhedra, make Doo and Sabin’s generalization of bi-quadratic (bi-2) subdivision surfaces unattractive for general design. Rather than tuning the eigenstructure of the subdivision matrix, we improve shape by adding a point and enriching the refinement rules. Adding a guiding point can also yield a polar bi-2 subdivision algorithm. Both the augmented and the polar bi-2 subdivision are complemented by a new Primal Bi-2 Subdivision scheme. All surfaces are $C^1$ and can be combined.     

Computing Approximate Shortest Paths on Convex Polytopes

The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algorithm for computing approximate shortest paths on a convex polyhedral surface. Given a convex polyhedral surface P in \reals ³ , two points s, t ∈ P , and a parameter \eps > 0 , it computes a path between s and t on P whose length is at most (1+\eps) times the length of the shortest path between those points. It constructs in time O(n/\sqrt \eps ) a graph of size O(1/\eps ⁴ ) , computes a shortest path on this graph, and projects the path onto the surface in O(n/\eps) time, where n is the number of vertices of P . In the postprocessing step we have added a heuristic that considerably improves the quality of the resulting path. Received July 25, 2000; revised June 6, 2001.