AbstractThe purpose of this paper is to present a new method to design exact geometric predicates in algorithms dealing with curved objects such as circular arcs. We focus on the comparison of the abscissae of two intersection points of circle arcs, which is known to be a difficult predicate involved in the computation of arrangements of circle arcs. We present an algorithm for deciding the x-order of intersections from the signs of the coefficients of a polynomial, obtained by a general approach based on resultants. This method allows the use of efficient arithmetic and filtering techniques leading to fast implementation as shown by the experimental results
International audienceWe examine the problem of computing exactly the Voronoi diagram (via the dual ...
This thesis provides efficient and robust algorithms for the computation of the intersection curve b...
The physical world in which we live is essentially geometric. Geometric computing is a central build...
International audienceThe purpose of this paper is to present a new method to design exact geometric...
We consider whether restricted sets of geometric predicates support efficient algorithms to solve li...
We describe exact representations and algorithms for geometric operations on general circles and cir...
AbstractWe consider whether restricted sets of geometric predicates support efficient algorithms to ...
AbstractLet Er and Eb be two sets of x-monotone and non-intersecting curve segments, E=Er∪Eb and |E|...
International audienceA lot of geometric predicates can be formulated as an arrangement of hypersurf...
Algorithms in Computational Geometry and Computer Aided Design are often developed for the Real RAM ...
AbstractAn efficient technique to solve precision problems consists in using exact computations. For...
AbstractWe study the predicates involved in an efficient dynamic algorithm for computing the Apollon...
International audienceWe propose an efficient method that determines the sign of a multivariate poly...
In this thesis, we define efficient and generic methods in order to solve the robustness problems th...
International audienceIn this article, I focus on the robustness of geometric programs (e.g., De-lau...
International audienceWe examine the problem of computing exactly the Voronoi diagram (via the dual ...
This thesis provides efficient and robust algorithms for the computation of the intersection curve b...
The physical world in which we live is essentially geometric. Geometric computing is a central build...
International audienceThe purpose of this paper is to present a new method to design exact geometric...
We consider whether restricted sets of geometric predicates support efficient algorithms to solve li...
We describe exact representations and algorithms for geometric operations on general circles and cir...
AbstractWe consider whether restricted sets of geometric predicates support efficient algorithms to ...
AbstractLet Er and Eb be two sets of x-monotone and non-intersecting curve segments, E=Er∪Eb and |E|...
International audienceA lot of geometric predicates can be formulated as an arrangement of hypersurf...
Algorithms in Computational Geometry and Computer Aided Design are often developed for the Real RAM ...
AbstractAn efficient technique to solve precision problems consists in using exact computations. For...
AbstractWe study the predicates involved in an efficient dynamic algorithm for computing the Apollon...
International audienceWe propose an efficient method that determines the sign of a multivariate poly...
In this thesis, we define efficient and generic methods in order to solve the robustness problems th...
International audienceIn this article, I focus on the robustness of geometric programs (e.g., De-lau...
International audienceWe examine the problem of computing exactly the Voronoi diagram (via the dual ...
This thesis provides efficient and robust algorithms for the computation of the intersection curve b...
The physical world in which we live is essentially geometric. Geometric computing is a central build...