Rapidly Getting Intersection Algorithm for Triangular Mesh Surface Models

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.