Lines avoiding unit balls in three dimensions, Discrete and Computational Geometry, vol.34, issue.2, pp.231-250, 2005. ,
Line transversals of balls and smallest enclosing cylinders in three dimensions, Discrete and Computational Geometry, vol.21, pp.373-388, 1999. ,
Davenport-Schinzel sequences and their geometric applications, Handbook of Computational Geometry, 1998. ,
Common tangents to spheres in R 3. Discrete and Computational Geometry, vol.35, pp.287-300, 2006. ,
URL : https://hal.archives-ouvertes.fr/inria-00070675
Lines and free line segments tangent to arbitrary three-dimensional convex polyhedra, SIAM Journal on Computing, vol.37, issue.2, pp.522-551, 2007. ,
Lines tangent to four triangles in three-dimensional space, Discrete and Computational Geometry, vol.37, issue.3, pp.369-380, 2007. ,
Transversals to line segments in three-dimensional space, Discrete and Computational Geometry, vol.34, issue.3, pp.381-390, 2005. ,
Lines in space: combinatorics and algorithms, Algorithmica, vol.15, 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
URL : https://doi.org/10.1016/s0747-7171(89)80003-3
The union of moving polygonal pseudodiscs-combinatorial bounds and applications, Computational Geometry: Theory and Applications, vol.11, pp.69-82, 1998. ,
,
On the complexity of umbra and penumbra, Computational Geometry: Theory and Applications, vol.42, issue.8, pp.758-771, 2009. ,
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. ,
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. ,
URL : https://hal.archives-ouvertes.fr/inria-00606717
On incremental rendering of silhouette maps of a polyhedral scene, Computational Geometry: Theory and Applications, vol.38, issue.3, pp.129-138, 2007. ,
New bounds for lower envelopes in three dimensions, with applications to visbility in terrains, Discrete and Computational Geometry, vol.12, pp.313-326, 1994. ,
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 and Computational Geometry, vol.26, pp.1-17, 2001. ,
The envelope of lines meeting a fixed line and tangent to two spheres, Discrete and Computational Geometry, vol.33, issue.4, pp.617-644, 2005. ,
Common transversals and tangents to two lines and two quadrics in P 3. Discrete and Computational Geometry, vol.30, pp.543-571, 2003. ,
On lines missing polyhedral sets in 3-space, Discrete and Computational Geometry, vol.12, pp.203-221, 1994. ,
The visibility complex, Internat. J. Comput. Geom. Appl, vol.6, issue.3, pp.279-308, 1996. ,
Lines avoiding balls in three dimensions revisited, 26th Annual ACM Symposium on Computational Geometry-SCG'10, pp.58-67, 2010. ,