An Accurate Algorithm for Rasterizing Algebraic Curves

In this paper we introduce a new algorithm for rasterizing algebraic curves, and we discuss applications to surface and surface-surface intersection rendering and visualization. By rustm”zing an algebraic curve we mean to determine which cells, or pixels, from a square mesh of cells in the plane, are cut by a curve represented as the set of zeros of a polynomial in two variables. By using a recursive space subdivision scheme, the problem is be reduced to testing whether the curve cuts a square or not. Other mwearchers have followed this approach, but their tests are either computationally expensive, or apply just to special cases. Curves with singularities are particularly difficult to deal with, and most know algorithms fail to nmder these curves correctly