|
An algorithm for computing the surface intersection between two
general parametric surfaces is proposed. Th algorithm consists
of two steps. In the first step, we find the significant points
- u-turning and border points. The second step traces the curve
component in a numerically stable manner. It is well recognized
that a good surface intersection algorithm should balance three
conflicting objectives: robustness, accuracy, and efficiency.
The proposed alogrithm is robust because it can find at least
one starting point for each intersection component by locating
the significant points. Morever, in tracing process, our
proposed alogrithm should be more efficient because we obtain
the tracing direction explicitly. Nevertheless, we observe that
computing the significant points for NURBS surfaces is not
efficient, especially for high degree surfaces. Also, as shown
in other existing methods singularities cannot be completely
resolved although the employed tracing procedure is capable of
handling many of the singularities.
|