J. Boissonnat and F. Preparata, Robust Plane Sweep for Intersecting Segments, SIAM Journal on Computing, vol.29, issue.5, pp.1401-1421, 2000.
DOI : 10.1137/S0097539797329373
URL : https://hal.archives-ouvertes.fr/inria-00073419

H. Bronnimann, O. Devillers, V. Dujmovic, H. Everett, M. Glisse et al., 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
URL : https://hal.archives-ouvertes.fr/inria-00103916

H. Brönnimann, H. Everett, S. Lazard, F. Sottile, and S. Whitesides, Transversals to Line Segments in Three-Dimensional Space, Discrete & Computational Geometry, vol.34, issue.3, pp.381-390, 2005.
DOI : 10.1007/s00454-005-1183-1

C. Burnikel, S. Funke, K. Mehlhorn, S. Schirra, and S. Schmitt, A Separation Bound for Real Algebraic Expressions, Proceedings of the 9th Annual European Symposium on Algorithms, pp.254-265, 2001.
DOI : 10.1007/3-540-44676-1_21

F. Duguet and G. Drettakis, Robust epsilon visibility, Proceedings of ACM SIGGRAPH 2002, pp.567-575, 2002.
DOI : 10.1145/566570.566618
URL : https://hal.archives-ouvertes.fr/inria-00606723

F. Durand, G. Drettakis, and C. Puech, The visibility skeleton, Proceedings of the 24th annual conference on Computer graphics and interactive techniques , SIGGRAPH '97, pp.89-100, 1997.
DOI : 10.1145/258734.258785
URL : https://hal.archives-ouvertes.fr/inria-00510088

F. Durand, G. Drettakis, and C. Puech, The 3D visibility complex, ACM Transactions on Graphics, vol.21, issue.2, pp.176-206, 2002.
DOI : 10.1145/508357.508362
URL : https://hal.archives-ouvertes.fr/inria-00606717

A. Efrat, L. Guibas, O. Hall-holt, and L. Zhang, On incremental rendering of silhouette maps of a polyhedral scene, Proceedings of the 11th ACM-SIAM Symp. on Discrete Algorithms, pp.910-917, 2000.
DOI : 10.1016/j.comgeo.2006.12.003

L. Glaves, An exploration of the 3D visibility complex, 2007.

M. Hohmeyer and S. Teller, Determining the lines through four lines, Journal of Graphics Tools, vol.4, issue.3, pp.11-22, 1999.

M. Mignotte, Identification of algebraic numbers, Journal of Algorithms, vol.3, issue.3, pp.197-204, 1982.
DOI : 10.1016/0196-6774(82)90019-0

H. Plantinga and C. Dyer, Visibility, occlusion, and the aspect graph, International Journal of Computer Vision, vol.6, issue.1, pp.137-160, 1990.
DOI : 10.1007/BF00054919

J. Redburn, Robust computation of the non-obstructed line segments tangent to four amongst n triangles, 2003.

E. R. Scheinerman, When Close Enough is Close Enough, The American Mathematical Monthly, vol.107, issue.6, pp.489-499, 2000.
DOI : 10.2307/2589344

K. Shoemake, Plücker coordinate tutorial, Ray Tracing News, vol.11, issue.1, 1998.

C. K. Yap, Towards exact geometric computation, Computational Geometry, vol.7, issue.1-2, pp.3-23, 1997.
DOI : 10.1016/0925-7721(95)00040-2
URL : http://doi.org/10.1016/0925-7721(95)00040-2