An algorithm for rapidly getting intersection of triangular mesh surface models is proposed, which reduces the intersecting regions through intersection test for the bounding boxes of nodes based on the dynamic spatial indexing structure of triangular mesh surface models, so that the sets of intersection triangular are exactly located and the intersection data of mesh surface models are obtained, then the intersecting process of triangular mesh surface models is completed by rapidly tracing the intersect curves. Experimental analysis shows that the exact intersection of two complex triangular mesh surface models can be rapidly obtained by this algorithm, and it has important meanings to tailoring, splicing and NC tool path generation of triangular mesh surface models.%提出一种三角网格曲面模型快速求交算法，该算法基于三角网格曲面模型动态空间索引结构，通过结点包围盒相交检测快速缩小求交范围，准确定位相交三角面片包围盒集合并对该集合进行排序，依次连接各包围盒内三角网格曲面模型交线数据，实现曲面模型交线快速提取．实例证明，该算法可有效地提高数据密集、形状复杂的三角网格曲面模型求交效率，对逆向工程中三角网格曲面模型的裁剪、拼接及数控加工刀轨生成具有重要意义．
展开▼
