We give a solution for the transformation of an algebraic plane curve
into a combinatorial graph where edges correspond to x-monotone segments
of the curve (curve analysis). The approach is exact in the sense that
it preserves the topology of the curve.
By combining exact and approximated calculations, our algorithm improves
the state-of-the-art solutions without sacrifying exactness. Although
certain genericity conditions are used during the analysis, we do not
impose any condition on the input curve and can therefore handle all
sorts of degeneracy.
My talk concentrates on how (controlled) approximation can be used to
speed up the analysis under the assumption of a generic position for the
curve.Analysing algebraic plane curves means to deduce various geometric
properties, such as locating singularities, counting incident arcs etc.
My talk explains how genericity conditions simplify the curve analysis
and how to transfer this techniques to arbitrary algebraic curves.