共查询到20条相似文献,搜索用时 422 毫秒
1.
反求工程中三角网格拓扑生成的算法研究 总被引:1,自引:1,他引:0
散乱点的三角网格剖分是反求工程中的第一个重要环节 ,在对三角剖分基本方法深入分析的基础上提出了动态圆的概念 ,使得搜索新三角形的范围大大降低 ,从而加快速度 ,并在搜索过程中实现Delaunay三角形优化。另外 ,通过动态更新搜索边控制三角形生成进度 ,将新三角形和已有三角形的相交判定转化为和搜索边的相交判定。 相似文献
2.
3.
4.
5.
STL File Generation with Data Reduction by the Delaunay Triangulation Method in Reverse Engineering 总被引:10,自引:0,他引:10
S.-M. Hur H.-C. Kim S.-H. Lee 《The International Journal of Advanced Manufacturing Technology》2002,19(9):669-678
Reverse engineering has been widely used for the shape reconstruction of an object without CAD data and typical steps include
the scanning of a clay or wood model and the generation of manufacturing data such as an STL file.
A new approach to remove point data with Delaunay triangulation is introduced to deal with the size problems of the STL file
and the difficulties in the operation of the rapid prototyping (RP) process. The selection of a group of triangles, based
on the angle, is used for a robust and reliable implementation of the Delaunay triangulation method. The developed software
enables the user to specify the criteria for the selection of the group of triangles by the angle between triangles, the percentage
of reduced triangles, and the allowable area.
This approach can be used to reduce the measuring data from the laser scanner, thus save the handling time of point data during
the modelling process and is useful for verifying and slicing the STL model during the RP process. 相似文献
6.
WU Shixiong WANG Chengyong School of Mechanical Electrical Engineering Guangdong University of Technology Guangzhou China CHEN Zichen College of Mechanical Energy Engineering Zhejiang University Hangzhou China 《机械工程学报(英文版)》2006,(1)
A region-growing method for reconstructing triangulated surfaces from massive unorganized points is presented. To save memory space, a ring data-structure is adopted to build connections between points and triangulated surfaces. The data-structure allows the efficient retrieval of all neighboring vertices and triangles of a given vertice. To narrow the search range of adjacent points and avoid mangle intersection, an influence area is defined for each active-edge. In the region-growing process of triangulated surfaces, a minimum-edge-angle-product algorithm is put forward to select an appropriate point to form a new triangle for an active edge. Results indicate that the presented method has high efficiency and needs less memory space, optimized triangulated surfaces with reliable topological quality can be obtained after triangulation. 相似文献
7.
8.
一种受约束的散乱点三角划分方法 总被引:4,自引:0,他引:4
提出了一种基于区域分割的方法来解决受任意边界、孔域、特征线约束的二维散乱点的三角划分问题。该方法分两个步骤 ,第一步实现散乱点的初始三角形连接 ,第二步实现三角形网格优化。在初始三角形连接中 ,每连接一个三角形 ,将待划分区域分为两至三个较小的区域 ,然后分别对每个区域内的散乱点进行三角划分 ,这样一直迭代下去 ,直至没有新区域出现为止。本方法不仅能解决非凸边界、孔域、特征线嵌入等三角划分中的难点 ,而且其计算量也少 相似文献
9.
提出了使用 VBA和面向对象的思想 ,在 Auto CAD上开发有限元网格划分程序的方法。本程序通过平铺法实现自动三角形网格划分 ,并可以用两种方法把三角形网格转化为四边形网格 :合并法和分割法。文中详细分析了 VBA面向对象的数据组织方法。实践证明VBA是一种方便、快捷、实用的二次开发工具 相似文献
10.
11.
12.
Wang Wen Wu Shixiong Chen Zichen Department of Mechanical Engineering Zhejiang University Hangzhou China 《机械工程学报(英文版)》2004,17(2):189-192
NC code or STL file can be generated directly from measuring data in a fas re-verse-engineering mode. Compressing the massive data from laser scanner is the key of the new mode.An adaptive compression method based on triangulated-surfaces model is put forwar. Normal-vectoranges between triangles are computed to find prime vertices for removal. Ring data structure isadopted to save massive data effectively. It allows the efficient retrieval of all neighboring vertices andtriangles of a given vertices. To avoid long and thin triangles, a new re-triangulation approach based onnormalized minimum-vertex-distance is proposed, in which the vertex distance and interior angle oftriangle are considered. Results indicate that the compression method has high efficiency and can getreliable precision. The method can be applied in fast reverse engineering to acquire an opimal subsetof the original massive data. 相似文献
13.
基于三角片法矢调整的三角网格模型光顺 总被引:1,自引:0,他引:1
提出了一种新的三角网格模型光顺方法。首先,对模型中每个三角片的每个顶点,分别求出其一邻域内所有三角片与当前三角片法矢夹角的变化率。然后,根据这种变化率的不同,相应采用拉普拉斯算子或Kuwahara滤波算子对三角片法矢进行调整。最后,基于调整后的三角片法矢,调整模型中各顶点位置,实现三角网格模型的光顺处理。方法中的拉普拉斯算子,适合于对模型中的非尖锐特征区域的光顺,可以快速取得理想的整体光顺效果;而Kuwahara滤波算子则适合于对模型中的特征区域的法矢调整,能够在去除噪声的同时保留原有特征。另外,本文还提出了一种新的误差估计方法,通过计算模型光顺前后的近似间隙体积,可以得到较精确的模型光顺误差。实例表明,与传统方法相比,本文方法在获得理想光顺效果的同时,能充分保留甚至调整加强模型原有特征且光顺前后模型的变形很小。 相似文献
14.
M. Shi Y. F. Zhang H. T. Loh C Bradley Y. S. Wong 《The International Journal of Advanced Manufacturing Technology》2006,30(1-2):54-60
This paper presents a triangulation method for modelling very large sets of cloud data. The three-dimensional (3D) data sets are produced by a machine vision system and/or coordinate measuring machine (CMM). The algorithm is suitable for processing the data collected from objects composed of free form surface patches especially with interior holes. This is accomplished from the 3D data sets in two steps. Firstly, the original cloud data is reduced into a simplified data set employing a data reduction technique (voxel binning method), in which the error between the cloud data and the meshed surface is used to control the data reduction. Secondly, the triangulation process starts with a randomly selected seed triangle. The triangular mesh extends outward by continuously linking suitable external points to it along the boundary edges of the meshed area. A complex free form surface with interior holes can be triangulated in one computing session without manually dividing it into several simple patches. The error-based data reduction parameters are extracted from the cloud data set, by a series of local surface patches, and the required spatial error between the final triangulation and the cloud data. Experimental results are given to illustrate the efficacy of the technique for rapidly constructing a geometric model from 3D digitised cloud data. 相似文献
15.
针对网格简化算法中出现的细节特征丢失、简化结果过于均匀以及计算复杂等问题,从原始模型的几何特征出发,对待折叠三角形与其邻域内三角形的形状与位置关系进行研究,对三角形折叠点到其三个顶点的偏离程度进行总结,提出了一种基于三角形折叠的保持模型特征的网格简化算法。该方法根据目标三角形各顶点邻域三角形的不同,为其3个顶点分配相应的权值,由各顶点权值的大小最终确定三角形折叠点坐标,然后以二次误差测度为度量标准计算出每个三角形的折叠代价,再结合三角形局部面积比、局部区域不平度以更好地控制简化结果。实验结果表明:该方法能够降低计算的复杂度、提高简化速度,使模型的特征区域和非特征区域均保持一定的简化率,并较好地保持了原始模型的细节特征。 相似文献
16.
空间散乱数据点的三角剖分是逆向工程的关键技术,本文提出了基于一种动态神经网络———神经元增长结构(GrowingCellStructure)的空间三角剖分新方法。这种方法具有可以直接处理带有噪声的数据,无需对数据进行平滑处理,网格规模可控,算法简单,生成的三角网格形状好等优点。 相似文献
17.
18.
19.