Exacts predicates for arrangement of arcs of circle 

A. Fronville

In this talk, we explain the techniques of effective algebraic geometry
(Bezoutian, Schur complement) used for a robustness problem in connection
with computational geometry.

We present a robust and efficient algorithm for sorting extremity of arc of
circle. We investigate different filters (static filters, semi-dynamic filter
or dynamic filters) and exact computation.

An implementation of this method has been done in C++ using the CGAL library
(Computational Geometry Algorithms Library) and the ALP library (Algébre
linéaire pour les polynômes).