Improving the topology computation of an arrangement of cubics

This paper is devoted to improve the efficiency of the algorithm introduced in [A. Eigenwillig, L. Kettner, E. Schömer, N. Wolpert, Exact, efficient and complete arrangement computation for cubic curves, Computational Geometry 35 (2006) 36–73] for analyzing the topology of an arrangement of real algebraic plane curves by using deeper the well-known geometry of reducible cubics instead of relying on general algebraic tools.