基于邻域多边形特征和能量优化的网格参数化

针对复杂网格曲面提出了一种基于点邻域多边形特征和能量优化的网格曲面参数化方法。首先利用相邻两边夹角和长度比例建立节点邻域多边形特征方程组,通过求解一个约束优化问题将曲面网格展平到二维平面上;在网格曲面展平过程中不可避免会产生弹性变形能,然后采用能量优化方法释放曲面展平过程中的弹性变形能,最终得到网格曲面参数化结果。计算结果表明,该方法能得到较好的参数化结果,适用于复杂曲面的网格重划分等计算机辅助设计的应用。     

一种复杂曲面展开的通用算法

提出了一种基于几何展开/力学修正的复杂曲面展开的通用算法,实现复杂曲面的展开.首先,对三维曲面进行三角化,用三角片模型来表达三维曲面;然后,采用几何展开的方法将三维曲面展开为初始二维平面;最后,提出一种改进的能量法优化算法,建立能量模型,对初始展开平面进行优化,得到最终展开结果.由于采用了能量法对初始展开片面进行优化,曲面展开的精度较易控制,因此能够更有效地解决CAD/CAM中的曲面展开问题.     

基于单元等变形的复杂曲面展开算法研究

针对板壳类零件展开问题提出了一种基于单元等变形的复杂曲面展开算法。首先利用有限元网格生成算法将零件曲面划分成三角形单元 ,然后按照单元等变形假设将三角形单元映射到平面上 ,从而得到曲面的展开形状与尺寸 ,并通过重新计算单元的变形率得到曲面内的应变分布。该算法可以将各种可展曲面和不可展曲面采用统一的形式展开 ,实际应用表明采用该算法展开复杂曲面时具有快速准确的特点 ,可以显著缩短零件从设计造型到求取其毛料外形的时间 ,适用于航空航天及汽车制造等工业领域内具有复杂曲面的金属板料零件的数字化展开。     

自由曲面自适应数字化及应用研究

自由曲面的数字化是自由曲面重建的关键技术之一。如何合理地对自由曲面进行采样 ,将关系到曲面重建精度和测量效率等重要问题。通过引入初始曲面概念 ,提出了基于物体重心的采样算法模型。该算法具有保存曲面拓扑信息和网格自组的功能 ,能够较准确地反映曲面的形状特征。     

不规则边界曲面的四边形-三角形混合网格展开法

提出了用四边形-三角形混合网格等面积展开的几何模拟法确定不规则边界曲面零件毛坯外形,并给出了四边形-三角形混合网格算法.     

网格曲面数控加工编程分型线提取算法

针对复杂网格曲面分型线提取精度和效率不高的问题,根据非封闭自由曲面和封闭自由曲面的拓扑信息和几何特点,提出了2种基于投影方法的分型线提取算法. 对非封闭模型,首先将模型投影到平面并重新三角网格化,然后提取投影三角网格的边界,最后以平面三角网格的边界为检索信息在原始网格中检索得到自由曲面的分型线. 对封闭模型,根据模具分模的几何原理,提出通过建立封闭自由曲面凹模和凸模离散几何模型的方法提取封闭自由曲面的分型点,然后通过一环邻域点搜索法对分型点排序,得到分型线. 实验结果和数据分析表明,两种方法可以精确、高效地提取非封闭和封闭自由曲面的分型线,并可以确保分型点都是三角网格曲面的顶点.     

基于外载荷的B样条曲面变形

针对B样条曲面变形过程中存在变形区域不能自由选择、变形距离不能精确计算和操作效率低等问题,运用能量优化的思想,提出一种B样条曲面变形的算法,用于B样条曲面的变形.给出B样条曲面按节点矢量划分成曲面片的方法,将曲面片类比为有限单元法中薄壁面单元,并将作用在B样条曲面片上的外载荷分解成曲面片四个端点力的双线性插值.分别建立B样条曲面内部能量方程和外载荷能量方程,外载荷的改变引起B样条曲面内部能量的变化,通过求解一个使B样条曲面内部能量变化量为最小的优化问题,得到变形后B样条曲面控制顶点的变化量.给出一种求解B样条曲面变形距离的计算方法,提高B样条曲面变形的精度和变形效率.最后的实例验证所提算法的有效性和实用性.     

复杂曲面的四边形网格生成算法

介绍了曲面网格化的铺砌法(Paving)，利用包络区域检测技术对网格生成过程中的冲突进行检测。将二维的铺砌方法应用于三维曲面的网格生成，本算法适用于复杂曲面的网格生成。     

不规则边界曲面的四边形-三角形混合网格展开法

提出了用四边形-三角形混合网格等面积展开的几何模拟法确定不规则边界曲面零件毛坯外形，并给出了四边形-三角形混合网格算法。     

基于隐式曲面的三角网格模型等距算法

针对三角网格模型，提出了一种基于隐式曲面的等距算法。该算法首先对三角网格模型进行拓扑重建，然后对顶点进行八叉树采样，由采样点及采样点的单位法矢点来构建隐式曲面，将隐式曲面等距，最后将原模型的顶点投影到等距曲面得到投影点，根据先前建立的拓扑关系，将投影点三角网格化得到等距后的三角网格模型。该算法在一定数值范围内避免了等距模型自交问题，而且等距模型三角网格均匀，质量高。     

一种通用的复杂曲面展开方法研究

提出了一种以中心三角片为基三角片的涟漪式初始曲面展开方法。给出了一种基于弹簧-质点模型的展开优化算法,实现了优化过程中时间步长的自适应选取,提出了三角片翻转区域整体调整方法,该算法综合了利用初速度和忽略初速度两种方法各自的优点。实验结果表明,该方法能够快速、有效地获得复杂曲面的不含翻转三角片的优化展开,具有一定的通用性。     

Optimal flattening of freeform surfaces based on energy model

Flattening of freeform surfaces (i.e., non-developable surfaces) is a difficult problem in engineering application. According to flattening distortions, a new development based on energy model is put forward in this paper. Given a doubly curved surface and using a triangle mesh subdivision, some triangles will be distorted when the surface is flattened. Generally, the developed plane will possess many splits. There are two kinds of developments: unconstrained flattening and constrained flattening, which are both analysed. In order to obtain a better pattern, the strain energy required to force a 3-D shape adopt the plane pattern should be minimised. At last a flattening algorithm is developed on the basis of theoretical analyses. Compared with the others, the proposed method can control the local precision easily, and is an effective method for flattening doubly curved surfaces.     

The development of a technique for 3D complex surface reconstruction from unorganized point cloud

In this paper, we propose a new neural network based on our two-level adaptive hierarchical clustering algorithm. The algorithm is to manage unorganized points, so that the triangular mesh models can be correctly obtained by applying the triangular mesh creation algorithm. We also develop adaptive self-flipping triangle edges to improve triangular mesh structure. Only one parameter, the maximal edge length of triangle, is needed in the neural network. The proposed two-level consists of the first level for clustering the cloud of points that has same order of the maximal edge length into a same cluster and the second level for generating triangular surface model or drape surfaces over the points of the same cluster. The normal vector for the generated triangular 3D surface model can be obtained from the second level. This helps to generate the STL file or stereolithography format. From the experimental results it can be shown that the proposed method is very effective for clustering unorganized point clouds for generating a triangular mesh of complex surfaces.     

General 3D offsetting of a triangular net using an implicit function and the distance fields

A novel approach which uses the distance fields based on cell subdivision and an implicit surface interpolation based on the radial basis function is proposed in order to get an accurate and error-free offset model of arbitrary shapes composed of a large number of triangle meshes. In the method, the space bounding the original model is divided into smaller cells. For the efficient calculation of distance fields, valid cells which will generate a portion of offset model are selected previously by the proposed detection algorithm. These valid cells are divided again into much smaller voxels which assure required accuracy. At each voxel, the distance fields are created by calculating the minimum distances between the corner points of voxels and the triangle meshes. For the more efficient calculation of distance fields, valid vertices among the triangle meshes which will generate minimum distances with current cell are selected by checking the intersection between current cell and a cone prism generated at each vertex of triangle meshes. In addition, a new approach based on an implicit surface interpolation scheme is proposed to perform two types of offsetting operations including uniform and non-uniform offsetting in the same framework. In the method, a smooth implicit surface is generated from the discrete offset distance values given by the user. After generating the whole distance fields, the offset surface was constructed by using the conventional marching cube algorithm together with mesh smoothing scheme. The effectiveness and validity of this new offset method was demonstrated by performing numerical experiments for the various types of triangle meshes.     

基于交互的B样条曲面重建与误差计算

基于三角网格模型的B样条曲面重建技术得到深入发展，计算与显示重建后的B样条曲面与原始测量三角网格之间的误差对分析曲面重建品质有重要作用。一种较为实用的B样条曲面重建方法是对三角网格模型进行四边界区域划分后进行栅格式采样，再根据采样点进行B样条曲面拟合。针对这种重建方法，研究了一种建立三角网格顶点与四边界区域对应关系的算法，再用离散的方法计算点到对应曲面的距离误差，最后用线性插值方法实现误差彩色．云图的显示。     

基于包围矩形的三轴铣削仿真建模技术研究

以三角面片离散法为基础对刀具和毛坯进行了建模。将包围矩形算法引入到刀具对毛坯切削的判断中,用其搜索发生切削关系的点并修改其高度值来完成刀具对毛坯的切削;优化三角面片重绘过程中的计算,从而减小了仿真过程中的计算量,提高了仿真速度,优化了仿真效果。     

高效率的三角网格模型保特征简化方法

部分三角网格模型因数据量庞大而导致其不便于存储、分析和显示,本文提出了一种结合网格精细化方法的三角形折叠网格简化算法以解决此问题。首先通过3~(1/2)网格细分法确定待折叠三角形三个顶点的修正坐标,并根据修正坐标初步确定折叠点位置,然后引入折叠点的拉普拉斯坐标和原三角形法向信息来更新折叠点位置,最后由三角形折叠后该区域的体积误差和被折叠三角形的平展度共同确定折叠代价,从而使网格优先从较为平坦和特征点较少的区域开始依次进行三角形折叠简化。对多个模型进行了实验测试和数据分析,结果表明该方法能够有效精简网格数据,与3个不同类型的简化方法相比,该方法的简化效率最高,而且能有效保持原网格模型的几何特征并控制简化三角形的质量。     

Springback prediction and optimization of variable stretch force trajectory in three-dimensional stretch bending process

Most of the existing studies use constant force to reduce springback while researching stretch force. However, variable stretch force can reduce springback more efficiently. The current research on springback prediction in stretch bending forming mainly focuses on artificial neural networks combined with the finite element simulation. There is a lack of springback prediction by support vector regression(SVR). In this paper, SVR is applied to predict springback in the three-dimensional stretch bending forming process, and variable stretch force trajectory is optimized. Six parameters of variable stretch force trajectory are chosen as the input parameters of the SVR model. Sixty experiments generated by design of experiments(DOE) are carried out to train and test the SVR model. The experimental results confirm that the accuracy of the SVR model is higher than that of artificial neural networks. Based on this model, an optimization algorithm of variable stretch force trajectory using particle swarm optimization(PSO) is proposed. The springback amount is used as the objective function. Changes of local thickness are applied as the criterion of forming constraints. The objection and constraints are formulated by response surface models. The precision of response surface models is examined. Six different stretch force trajectories are employed to certify springback reduction in the optimum stretch force trajectory, which can efficiently reduce springback. This research proposes a new method of springback prediction using SVR and optimizes variable stretch force trajectory to reduce springback.     

快速全天自主星图识别

为了克服三角形识别算法中三角形因特征维数较低带来的冗余匹配问题,对该算法进行了改进.在利用标记法进行三角形识别的基础上,引入三角形以外的第四颗星,并以其为顶点,与三角形构成假想的四面体,顶点与底面三角形3个点的角距既可作为识别特征量,也可用于检验识别的结果是否正确.识别算法以星对角距作为主要识别特征,增加星等差为辅助识别特征,减少了对冗余数据的存储,使导航特征库的容量仅有0.4 Mb.在识别过程中,利用散列查找法对识别特征构造散列函数,减少了对导航特征库遍历比较的次数和时间开销,加快了识别过程,平均识别时间为0.43 ms.仿真实验结果表明,该识别算法在较大位置和星等误差时具有较短的识别时间和较高的识别率.     

体素模型表面优化提取方法及图形显示

三维体数据的显示方法有2种直接体绘制方法和间接体绘制方法。本文首先比较了这2种体数据显示方法的优缺点,然后介绍了基于渐进立方体(MarchingCubes)方法的间接体绘制方法。根据压缩形式的体素模型特点,提出了一种新的体素模型表面三角网格提取优化算法,该算法利用材料变化信息直接在位于物体表面的体素模型中提取表面三角网格,与传统的MarchingCubes算法相比,该算法不仅可以跨越物体外部全空的体素,还可以跨越位于物体内部全实的体素。该方法在基于Voxel模型的五坐标数控加工仿真系统中得到了应用,测试结果表明,采用该方法提取体素模型表面三角网格时可以提高效率2~3倍。