A surface-surface intersection algorithm is an important element in the development of a geometric modeler. This paper presents a new algorithm for calculating the intersection curves of two parametric surfaces. Combining the merits of subdivision and global exploration methods, this algorithm is efficient and robust in dealing with the issues related to small loops and singularities. This algorithm is demonstrated with examples of non-uniform rational B-spline surfaces.

This content is only available via PDF.
You do not currently have access to this content.