Computational geometry has produced an impressive wealth of efficient algorithms. The
robust implementation of these algorithms remains a major issue. Among the many …

Computational geometry emerged as a discipline in the seventies and has had considerable
success in improving the asymptotic complexity of the solutions to basic geometric problems …

Arrangements of curves constitute fundamental structures that have been intensively studied
in computational geometry. Arrangements have numerous applications in a wide range of …

We present algorithmic, complexity and implementation results concerning real root isolation
of a polynomial of degree d, with integer coefficients of bit size≤ τ, using Sturm (-Habicht) …

We present the first release of the Exacus C++ libraries. We aim for systematic support of
non-linear geometry in software libraries. Our goals are efficiency, correctness …

We present the first exact, complete and efficient implementation that computes for a given
set P= p1,..., pn of quadric surfaces the planar map induced by all intersection curves p1∩ …

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 …

We present a generic C++ design to perform exact geometric computations efficiently using
lazy evaluations. Exact geometric computations are critical for the robustness of geometric …

Arrangements of planar curves are fundamental structures in computational geometry.
Recently, the arrangement package of Cgal, the Computational Geometry Algorithms …

We present an approach for the exact and efficient computation of a cell in an arrangement
of quadric surfaces. All calculations are based on exact rational algebraic methods and …