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
Transversals to line segments in threedimensional space, Discrete and Computational Geometry, pp.381-390, 2005. ,
The number of lines tangent to arbitrary convex polyhedra in 3D, Proceedings of the twentieth annual symposium on Computational geometry , SCG '04, pp.46-55, 2004. ,
DOI : 10.1145/997817.997827
Robust epsilon visibility, Proc. Siggraph'02, pp.3-567, 2002. ,
URL : https://hal.archives-ouvertes.fr/inria-00606723
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
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
On incremental rendering of silhouette maps of a polyhedral scene, Proc. 11th ACM-SIAM Symp. on Discrete Algorithms, pp.910-917, 2000. ,
DOI : 10.1016/j.comgeo.2006.12.003
Structures de visibilité globales : tailles, calculs et dgnrescences, 2004. ,
Determining the lines through four lines, Journal of Graphics Tools, vol.4, issue.3, pp.11-22, 1999. ,
Visibility, occlusion, and the aspect graph, International Journal of Computer Vision, vol.6, issue.1, pp.137-160, 1990. ,
DOI : 10.1007/BF00054919
Robust computation of the non-obstructed line segments tangent to four amongst n triangles, 2003. ,
Plücker coordinate tutorial, Ray Tracing News, 1998. ,