论文标题
基于切断细分市场的空间中三角形的交集
Intersection of triangles in space based on cutting off segment
论文作者
论文摘要
本文提出了一种基于计算机图形算法的使用 - 在3D空间中找到三角形三角形交点的新方法 - 在移动和旋转空间坐标轴的开头时，切断了平面上的段。该方法是通过合成在平面上切断段的两种方法来获得的-Cohen-Sutherland算法和FC-Algorithm。在提出的方法中，3D空间中三角形三角形相交的问题减少到了平面上更简单，更少的资源密集型截止问题。该方法的主要特征是开发的方案是编码相对于三角段平面的截止点。该方案使您可以摆脱大量昂贵的计算。在本文中，考虑了三角形，三角形平面的交集和巧合的三角形交集的案例。所提出的方法可以用于使用有限元方法以及图像处理来解决四面体交叉点的问题。
The article proposes a new method for finding the triangle-triangle intersection in 3D space, based on the use of computer graphics algorithms -- cutting off segments on the plane when moving and rotating the beginning of the coordinate axes of space. This method is obtained by synthesis of two methods of cutting off segments on the plane -- Cohen-Sutherland algorithm and FC-algorithm. In the proposed method, the problem of triangle-triangle intersection in 3D space is reduced to a simpler and less resource-intensive cut-off problem on the plane. The main feature of the method is the developed scheme of coding the points of the cut-off in relation to the triangle segment plane. This scheme allows you to get rid of a large number of costly calculations. In the article the cases of intersection of triangles at parallelism, intersection and coincidence of planes of triangles are considered. The proposed method can be used in solving the problem of tetrahedron intersection, using the finite element method, as well as in image processing.
