Given an algebraic hypersurface O in Êd, how many simplices are necessary for a simplicial complex isotopic to O? We address this problem and the variant where all vertices of the...
We report on a generic uni- and bivariate algebraic kernel that is publicly available with Cgal 3.7. It comprises complete, correct, though efficient state-of-the-art implementati...
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 develop methods for the variational design of algebraic curves. Our approach is based on truly geometric fairness criteria, such as the elastic bending energy. In addition, we ...
An algorithm and implementation is presented to compute the exact arrangement induced by arbitrary algebraic surfaces on a parametrized ring Dupin cyclide. The family of Dupin cyc...
In this paper, we consider the problem of analysing the shape of an object defined by polynomial equations in a domain. We describe regularity criteria which allow us to determine...
The goal of algebraic geometry is to gain an understanding of the behaviour of functions related by polynomial relationships. Algebraic curves and surfaces having considerable adva...
We present an approach that extends the BentleyOttmann sweep-line algorithm [3] to the exact computation of the topology of arrangements induced by non-singular algebraic curves o...
Given a Cylindrical Algebraic Decomposition of an implicit algebraic curve, visualizing distinct curve arcs is not as easy as it stands because, despite the absence of singularitie...
Pavel Emeliyanenko, Eric Berberich, Michael Sagral...
The context of this work is lateral vehicle control using a camera as a sensor. A natural tool for controlling a vehicle is recursive filtering. The well-known Kalman fil...
Jean-Philippe Tarel, Sio-Song Ieng, Pierre Charbon...