论文部分内容阅读
提出了一种新的曲面求交算法，采用精度好、效率高、计算稳定的迭代方法求得等参数网格线在曲面上的交点，并通过跟踪获得两曲面的交线。本算法由三个子算法组成，一个是求曲面上到固定点距离最近的点，一个是求参数网格线与曲面的交点，一个是求曲面与曲面的交点。为保证不遗漏交点，利用第一个算法对参数网格点进行分类，跟踪交点时利用第三个求下一个交点。与离散法求交相比，本算法具有计算稳定性、可靠性好，速度快，精度高的优点
A new intersection algorithm is proposed. The intersection of isoparametric gridlines on the surface is obtained by the iterative method with good accuracy, high efficiency and stable computation, and the intersection of the two surfaces is obtained by tracking. The algorithm consists of three sub-algorithms, one is to find the point from the fixed point to the nearest point, one is to find the intersection of the grid and the surface parameters, one is to find the intersection of the surface and the surface. In order to ensure that the intersection is omitted, the first algorithm is used to classify the parameter grid points. When tracking the intersection, the third one is used to find the next intersection. Compared with the discrete method, the proposed algorithm has the advantages of stable computing, good reliability, high speed and high accuracy