compute a tangency point ? ; if z q , z j , z k and ? , z j , z k have the same 2D orientation then return " no conflict " ; else return ,
Efficient algorithms for line and curve segment intersection using restricted predicates, Computational Geometry, vol.16, issue.1, pp.35-5210, 2000. ,
DOI : 10.1016/S0925-7721(99)00057-7
URL : http://doi.org/10.1016/s0925-7721(99)00057-7
Convex Hull and Voronoi Diagram of Additively Weighted Points, Proceedings of 13th Annual European Symposium on Algorithms (ESA 2005), pp.367-378, 2005. ,
DOI : 10.1007/11561071_34
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra, SIAM Journal on Computing, vol.37, issue.2, pp.522-551, 2007. ,
DOI : 10.1137/S0097539705447116
On degeneracy in geometric computations, Proc. 5th ACM-SIAM Sympos. Discrete Algorithms, pp.16-23, 1994. ,
Algebraic methods and arithmetic filtering for exact predicates on circle arcs, Computational Geometry, vol.22, issue.1-3, pp.119-142, 2002. ,
DOI : 10.1016/S0925-7721(01)00050-5
URL : https://hal.archives-ouvertes.fr/inria-00166709
Predicates for line transversals to lines and line segments in three-dimensional space, Proceedings of the twenty-fourth annual symposium on Computational geometry , SCG '08, pp.174-181, 2008. ,
DOI : 10.1145/1377676.1377704
URL : https://hal.archives-ouvertes.fr/inria-00336256
Qualitative Symbolic Perturbation: a new geometry-based perturbation framework, Research Report, vol.8153 ,
URL : https://hal.archives-ouvertes.fr/hal-00758631
Perturbations for Delaunay and weighted Delaunay 3D triangulations, Computational Geometry, vol.44, issue.3, pp.160-168, 2011. ,
DOI : 10.1016/j.comgeo.2010.09.010
URL : https://hal.archives-ouvertes.fr/inria-00560388
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms, ACM Transactions on Graphics, vol.9, issue.1, pp.66-104, 1990. ,
DOI : 10.1145/77635.77639
A General Approach to Removing Degeneracies, SIAM Journal on Computing, vol.24, issue.3, pp.650-66410, 1995. ,
DOI : 10.1137/S0097539792235918
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.2649
The predicates of the Apollonius diagram: algorithmic analysis and implementation Special Issue on Robust Geometric Algorithms and their Implementations, Computational Geometry: Theory and Applications, vol.33, issue.12, pp.18-57, 2006. ,
The Euclidean InSphere Predicate, 2013. ,
A deterministic pseudorandom perturbation scheme for arbitrary polynomial predicates, 1986. ,
Randomized incremental construction of abstract Voronoi diagrams, Computational Geometry, vol.3, issue.3, pp.157-184, 1993. ,
DOI : 10.1016/0925-7721(93)90033-3
Robust proximity queries, Proceedings of the thirteenth annual symposium on Computational geometry , SCG '97, pp.864-889, 1998. ,
DOI : 10.1145/262839.262922
A general approach to the analysis of controlled perturbation algorithms, Computational Geometry, vol.44, issue.9, pp.507-528, 2011. ,
DOI : 10.1016/j.comgeo.2011.06.001
The Nature and Meaning of Perturbations in Geometric Computing, Discrete & Computational Geometry, vol.19, issue.1, pp.1-17, 1998. ,
DOI : 10.1007/PL00009330
Perturbations in geometric computing, 2013. Talk at the Workshop on Geometric Computing ,
DOI : 10.1007/pl00009330
A geometric consistency theorem for a symbolic perturbation scheme, Journal of Computer and System Sciences, vol.40, issue.1, pp.2-1810, 1990. ,
DOI : 10.1016/0022-0000(90)90016-E
Symbolic treatment of geometric degeneracies, Journal of Symbolic Computation, vol.10, issue.3-4, pp.349-370, 1990. ,
DOI : 10.1016/S0747-7171(08)80069-7
URL : http://doi.org/10.1016/s0747-7171(08)80069-7
THE EXACT COMPUTATION PARADIGM, Computing in Euclidean Geometry, pp.452-492, 1995. ,
DOI : 10.1142/9789812831699_0011