关键词: R*S-树, 跟踪提取, 均匀离散, 曲面求交, 三角Bézier曲面

Abstract: An algorithm of rapidly getting intersection curves for triangular Bézier surface is proposed, which includes four steps. The intersection regions are obtained rapidly based on the dynamic spatial indexing structure named R*S-tree of triangular Bézier surface models, so that the sets of intersection triangular Bézier patches are located exactly. Each Bézier patch is subdivided into many triangular planar patches in the scope of the precision by setting the discrete precision. The intersection line data is obtained through the intersection of triangular planar patches. The intersection curves are obtained by tracking extraction of intersection lines which have the common end point on line segments. The experimental results show that the algorithm can obtain the exact intersection curves of two complex triangular Bézier surface models rapidly, and it is proved to be applicable through generating NC tool path for triangular Bézier surface based on this algorithm.

Key words: R*S-tree, Surface intersection, Tracking extraction, Triangular Bézier surface, Uniform subdivision