摘要
反求工程中测量所得的三维数据一般是海量和无序的,为了提高重构的计算速度,减少存储空间,同时突出建模特征,在分析了常用数据精简方法的基础上提出了利用三角网格模型,以排序函数为依据简化数据的一种三角形折叠算法.该算法先以估算曲率的大小对欲精简数据进行划分,然后对各个区域的三角面构造可调加权排序函数.以排序函数为依据由小到大进行三角形折叠,算法以到相关三角平面距离最短的点作为新点来代替被折叠的三角面,以精简前后区域内的顶点法矢标准偏差和排序函数阀值对精简进行控制.试验表明,此算法排序函数构造简单,计算方便,对较光滑的模型数据处理是有效的.
Three-dimensional data measured in reverse engineering are abundant and disordered. In order to increase calculation speed of reconstruction, reduce memory space, and, at the same time, emphasize modelling characteristics, a method of data reduction with triangular folding was proposed by using triangular meshes model and ordering function on the basis of analysis of data reduction method available. For this purpose, the data to be reduced was first divided according to the estimation of curvature magnitude, and then a weighing controllable ordering function was constituted for every triangular region to fold the triangles with it in their incremental sequence in size. In the process of reduction, the point closest to the related triangular planes was taken as renewed point to substitute for the triangular planes folded and the standard deviation of normal vectors at the vertices of triangular regions before and after reduction and the threshold of ordering function were used to control the reduction. It was shown by the experiment that the configuration of the ordering function in＇this algorithm was simple, computation easy, and was effective for processing of the data with a smoother model.
出处
《兰州理工大学学报》
CAS
北大核心
2007年第1期40-43,共4页
Journal of Lanzhou University of Technology
关键词
数据精简
三角形折叠
顶点法矢
曲率估算
data reduction
triangle folding
vertex normal vector
curvature estimation
