A Subdivision Arrangement Algorithm for Semi-Algebraic Curves: An Overview

Abstract

We overview a new method for computing the arrangement of semi-algebraic curves. A subdivision approach is used to compute the topology of the algebraic objects and to segment the boundary of regions defined by these objects. An efficient insertion technique is described, which detects regions in conflict and updates the underlying arrangement structure. We describe the general framework of this method, the main region insertion operation and the specializations of the key ingredients for the different types of objects: implicit, parametric or piecewise linear curves.