A fundamental problem in computational geometry is the computation of the topology of a real algebraic plane curve given by its implicit equation, that is, the computation of a set of polygonal lines that approximates the curve while preserving its topology. A critical step in many algorithms computing the topology of a plane curve is the computation of the… (More)