We consider the problem of computing a representation of the plane graph induced by one (or more) algebraic curves in the real plane. We make no assumptions about the curves, in p...
We show how to compute the planar arrangement induced by segments of arbitrary algebraic curves with the Bentley-Ottmann sweep-line algorithm. The necessary geometric primitives r...
An algorithm is presented for the computation of the topology of a non-reduced space curve defined as the intersection of two implicit algebraic surfaces. It computes a Piecewise ...
Daouda Niang Diatta, Bernard Mourrain, Olivier Rua...
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decompos...
Eric Berberich, Pavel Emeliyanenko, Alexander Kobe...
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step t...
Laurent Dupont, Michael Hemmer, Sylvain Petitjean,...