B. Aronov and M. Sharir, The common exterior of convex polygons in the plane, Computational Geometry, vol.8, issue.3, pp.139-149, 1997.
DOI : 10.1016/S0925-7721(96)00004-1

H. Brönnimann, O. Devillers, V. Dujmovi?, H. Everett, M. Glisse et al., On the number of maximal free line segments tangent to arbitrary three-dimensional convex polyhedra, 2005.

H. Brönnimann, O. Devillers, V. Dujmovi?, 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, 2006.
DOI : 10.1137/S0097539705447116

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

G. Drettakis and E. Fiume, A fast shadow algorithm for area light sources using backprojection, Proceedings of the 21st annual conference on Computer graphics and interactive techniques , SIGGRAPH '94, pp.223-230, 1994.
DOI : 10.1145/192161.192207
URL : https://hal.archives-ouvertes.fr/inria-00510136

F. Durand, A multidisciplinary survey of visibility, ACM SIGGRAPH course notes, Visibility, Problems, Techniques, and Applications, 2000.

F. Durand, G. Dretakkis, 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. Dretakkis, and C. Puech, Fast and accurate hierarchical radiosity using global visibility, ACM Transactions on Graphics, vol.18, issue.2, pp.128-170, 1999.
DOI : 10.1145/318009.318012
URL : https://hal.archives-ouvertes.fr/inria-00073244

F. Durand, G. Dretakkis, 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

J. Hasenfratz, M. Lapierre, N. Holzschuch, and F. Sillion, A Survey of Real-time Soft Shadows Algorithms, Eurographics, 2003.
DOI : 10.1111/j.1467-8659.2003.00722.x
URL : https://hal.archives-ouvertes.fr/inria-00281388

P. S. Heckbert, Discontinuity meshing for radiosity, Proceedings of the Third Eurographics Workshop on Rendering, pp.203-215, 1992.

K. Kedem, R. Livne, J. Pach, and M. Sharir, On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles, Discrete & Computational Geometry, vol.20, issue.1, pp.59-71, 1986.
DOI : 10.1007/BF02187683

P. Mamassian, D. C. Knill, and D. Kersten, The perception of cast shadows, Trends in Cognitive Sciences, vol.2, issue.8, pp.288-295, 1998.
DOI : 10.1016/S1364-6613(98)01204-2

T. Nishita and E. Nakamae, Half-tone representation of 3D objects illuminated by area sources or polyhedron sources, IEEE Computer Society's 7th International Computer Software and Applications Conference (COMPSAC '83), pp.237-242, 1983.

G. Salmon, Analytic Geometry of Three Dimensions, 1978.

A. J. Stewart and S. Ghali, Fast computation of shadow boundaries using spatial coherence and backprojections, Proceedings of the 21st annual conference on Computer graphics and interactive techniques , SIGGRAPH '94, pp.231-238, 1994.
DOI : 10.1145/192161.192210

S. J. Teller, Computing the antipenumbra of an area light source, Computer Graphics Proceedings, Annual Conference Series, ACM SIGGRAPH, pp.139-148, 1992.

L. Wanger, The effect of shadow quality on the perception of spatial relationships in computer generated images, Computer Graphics, vol.25, issue.2, pp.39-42, 1992.

A. Wiernik and M. Sharir, Planar realizations of nonlinear davenport-schinzel sequences by segments, Discrete & Computational Geometry, vol.25, issue.1, pp.15-47, 1988.
DOI : 10.1007/BF02187894

A. Woo, P. Poulin, and A. Fournier, A survey of shadow algorithms, IEEE Computer Graphics and Applications, vol.10, issue.6, pp.13-32, 1990.
DOI : 10.1109/38.62693