基于STL三角网格模型简化的研究

Research on triangular mesh model simplification based on STL

针对STL三角网格模型简化中的相关问题进行了研究,并设计出了相应的算法。三角网格的简化过程包括网格删除和网格重建两个过程,在网格的删除中,根据设定的三角形的权重阈值选择删除被删除的三角形区域。在网格重建中,任意选择重建区域的一个顶点,通过渐进收缩的方式,将新生成的三角形边构造一个平衡二叉树,再以三角网格的适应度和平滑度为依据,找出所有二叉树中最佳的分支,使重建的三角网格最优化。对两个实例进行探讨,实现对不同STL三角网格的验证,并以原始网格模型与简化后的网格模型进行对比,表明研究所得的简化网格模型既有效地实现了STL网格模型的简化,又保持了原有STL网格模型的基本特征,达到令人满意的结果。

Aimed to the issues related to the simplification of STL triangular network mesh model,the corresponding algorithmis researched and designed.The simplification process of the triangle network mesh consists of grid deleting and the grid reconstruction,while dealing with the grid deleting,according to the weight threshold values of the triangle set to choose to delete the region of the triangle deleted.While dealing with the grid reconstruction,to choose a reconstruction region＇s vertex randomly and via the way of gradual contraction of constructing the new triangle edges to a balance binary tree and then according to the fitness and smoothness as the basis to identify the best branch of all the binary trees,so that the reconstruction triangular network mesh＇s optimization can be obtained.Finally, two examples are discussed to realize to verify the different STL triangular network mesh and compare the original network mesh model and the network mesh simplified,which shows the network mesh model simplified that is effective to achieve the STL network mesh simplification meanwhile maintaining the basic features of the original STL model and the satisfactory results can be achieved.