AN EFFICIENT SURFACE INTERSECTION ALGORITHM-BASED ON LOWER-DIMENSIONAL FORMULATION

We present an efficient algorithm to compute the intersection of algeb raic and NURBS surfaces. Our approach is based on combining the marchi ng methods with the algebraic formulation. In particular, we propose a matrix representation for the intersection curve and compute it accur ately using matrix computations. Ne present algorithms to compute a st art point on each component of the intersection curve (both open and c losed components), detect the presence of singularities, and find all the curve branches near the singularity. Ne also suggest methods to co mpute the step size during tracing to prevent component jumping. The a lgorithm runs an order of magnitude faster than previously published r obust algorithms. The complexity of the algorithm is output sensitive.