Lines Avoiding Unit Balls in Three Dimensions, Discrete & Computational Geometry, vol.34, issue.2, pp.231-250, 2005. ,
DOI : 10.1007/s00454-005-1166-2
Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions, Discrete & Computational Geometry, vol.21, issue.3, pp.373-388, 1999. ,
DOI : 10.1007/PL00009427
Davenport-Schinzel sequences and their geometric applications, Handbook of Computational Geometry, 1998. ,
Common Tangents to Spheres in ???3, Discrete & Computational Geometry, vol.35, issue.2, pp.287-300, 2006. ,
DOI : 10.1007/s00454-005-1230-y
URL : https://hal.archives-ouvertes.fr/inria-00100261
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
Lines Tangent to Four Triangles in Three-Dimensional Space, Discrete & Computational Geometry, vol.37, issue.3, pp.369-380, 2007. ,
DOI : 10.1007/s00454-006-1278-3
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
Lines in space: Combinatorics and algorithms, Algorithmica, vol.6, issue.5, pp.428-447, 1996. ,
DOI : 10.1007/BF01955043
Visibility problems for polyhedral terrains, Journal of Symbolic Computation, vol.7, issue.1, pp.11-30, 1989. ,
DOI : 10.1016/S0747-7171(89)80003-3
The union of moving polygonal pseudodiscs ??? Combinatorial bounds and applications, Computational Geometry, vol.11, issue.2, pp.69-82, 1998. ,
DOI : 10.1016/S0925-7721(98)00020-0
The Open Problems Project ? problem 61 ,
On the complexity of umbra and penumbra, Computational Geometry, vol.42, issue.8, pp.42758-771, 2009. ,
DOI : 10.1016/j.comgeo.2008.04.007
URL : https://hal.archives-ouvertes.fr/inria-00186262
The Expected Number of 3D Visibility Events Is Linear, SIAM Journal on Computing, vol.32, issue.6, pp.1586-1620, 2003. ,
DOI : 10.1137/S0097539702419662
URL : https://hal.archives-ouvertes.fr/inria-00071914
A multidisciplinary survey of visibility, ACM Siggraph course notes, Visibility, Problems, Techniques, and Applications, 2000. ,
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
New bounds for lower envelopes in three dimensions, with applications to visibility in terrains, Discrete & Computational Geometry, vol.6, issue.3, pp.313-326, 1994. ,
DOI : 10.1007/BF02574383
Line transversals of convex polyhedra in R 3, 20th Annual ACM-SIAM Symposium on Discrete Algorithms - SODA'09, pp.170-179, 2009. ,
Common Tangents to Four Unit Balls in R 3, Discrete & Computational Geometry, vol.26, issue.1, pp.1-17617, 2001. ,
DOI : 10.1007/s004540010090
Common Transversals and Tangents to Two Lines and Two Quadrics in P, Discrete and Computational Geometry, vol.30, issue.4, pp.543-571, 2003. ,
DOI : 10.1007/s00454-003-0789-4
On lines missing polyhedral sets in 3-space, Discrete & Computational Geometry, vol.8, issue.1, pp.203-221, 1994. ,
DOI : 10.1007/BF02574376
THE VISIBILITY COMPLEX, International Journal of Computational Geometry & Applications, vol.06, issue.03, pp.279-308, 1996. ,
DOI : 10.1142/S0218195996000204
Lines avoiding balls in three dimensions revisited, 26th Annual ACM Symposium on Computational Geometry -SCG'10, 2010. ,