Evaluating surface intersections in lower dimensions

We highlight a new algorithm for evaluating the sur-face intersection curve using a matrix formulation. The projection
of the intersection curve is represented as the singular set of a bi-
variate matrix polynomial. The resulting algorithm for evaluating
the intersection curve is based on matrix computations like eigen-
decomposition and singular value decomposition. Furthermore, at
each stage of the algorithm we make use of inverse power iterations
to march back to the curve. We also describe the performance of the
resulting robust and accurate approach