章雅娟, 姜晓峰. 一种STL中交错三角片的识别与删除算法[J]. 微电子学与计算机, 2010, 27(11): 143-146,150.
引用本文: 章雅娟, 姜晓峰. 一种STL中交错三角片的识别与删除算法[J]. 微电子学与计算机, 2010, 27(11): 143-146,150.
ZHANG Ya-juan, JIANG Xiao-feng. Recognition and Deletion Algorithm of Interlaced Triangular Meshes in STL Files[J]. Microelectronics & Computer, 2010, 27(11): 143-146,150.
Citation: ZHANG Ya-juan, JIANG Xiao-feng. Recognition and Deletion Algorithm of Interlaced Triangular Meshes in STL Files[J]. Microelectronics & Computer, 2010, 27(11): 143-146,150.

一种STL中交错三角片的识别与删除算法

Recognition and Deletion Algorithm of Interlaced Triangular Meshes in STL Files

  • 摘要: 介绍了一种基于STL表示的三角网格模型中交错三角片的识别与删除算法.该方法首先对STL三角网格模型重新建立拓扑关系;接着将网格模型包围盒划分成若干个小的立方体包围盒,并记录和各立方体包围盒相贯的三角片ID号;然后检测单个立方体包围盒中的三角片包围盒空间是否重叠,在空间重叠的基础上进一步检测两个三角片是否交错;最后将所有标志为交错的三角片及其拓扑关系删除.算例结果证明了该算法的可行性和高效性,并优化了逆向工程相关应用中三角网格模型的质量.

     

    Abstract: This paper introduces the method for recognizing and deleting in terlaced triangular meshes in the triangularmesh model which is expressed based on STL files. Firstly, establishes the topology relations to the STL triangular mesh mode1; Secondly the surrounding box of mesh model is divided into certain small cube surrounding boxes, and records ID numbers of triangular meshes of this cube space that is pierced in the cube surrounding boxes; Then examines whether space of surrounding box of triangular meshes to be overlapped or not in each cube surrounding box, further determines whether two triangular meshes to be folded or not on base of spatial overlap; Finally deletes all triangular meshes and its topology relations which are symbolized interlaced triangular meshes. The example proves that this algorithm is feasible and highly effective and optimizes the quality of triangular mesh model in application of revers engineering.

     

/

返回文章
返回