P. K. Agarwal and M. Sharir, Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions, SIAM Journal on Computing, vol.25, issue.1, pp.100-116, 1996.
DOI : 10.1137/S0097539793244368

P. K. Agarwal and M. Sharir, Davenport-Schinzel sequences and their geometric applications, Handbook of Computational Geometry, 1998.

T. Akenine-möller and U. Assarsson, Approximate soft shadows on arbitrary surfaces using penumbra wedges, Proceedings of the 13th Eurographics Workshop on Rendering (EGRW'02), pp.297-306, 2002.

A. M. Andrew, Another efficient algorithm for convex hulls in two dimensions, Information Processing Letters, vol.9, issue.5, pp.216-219, 1979.
DOI : 10.1016/0020-0190(79)90072-3

P. Angelier and M. Pocchiola, CGAL-based implementation of visibility complexes, Effective Computational Geometry for Curves and Surfaces, 2003.

P. Angelier and M. Pocchiola, A Sum of Squares Theorem for Visibility Complexes and Applications, Discrete and Computational Geometry, pp.79-139, 2003.
DOI : 10.1007/978-3-642-55566-4_5

J. Arvo and D. Kirk, A survey of ray tracing acceleration techniques, 1989.

D. R. Baum, H. E. Rushmeier, and J. M. Winget, Improving radiosity solutions through the use of analytically determined form-factors, Proceedings of the 16th annual conference on Computer graphics and interactive techniques (SIGGRAPH'89), pp.325-334, 1989.

J. Bittner, Efficient construction of visibility maps using approximate occlusion sweep, Proceedings of the 18th spring conference on Computer graphics , SCCG '02, pp.167-175, 2002.
DOI : 10.1145/584458.584486

J. Bittner and P. Wonka, Visibility in Computer Graphics, Environment and Planning B: Planning and Design, vol.31, issue.3, pp.729-756, 2003.
DOI : 10.1068/b2957

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. Brönnimann, C. Burnikel, and S. Pion, Interval arithmetic yields efficient dynamic filters for computational geometry, Proceedings of the 14th ACM Annual Symposium on Computational Geometry (SoCG'98), pp.165-174, 1998.

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, pp.522-551, 2007.
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

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 (ESA'01), volume 2161 of Lecture Notes in Computer Science, pp.254-265, 2001.

F. Cho and D. Forsyth, Interactive ray tracing with the visibility complex, Special issue on Visibility - Techniques and Applications, pp.703-717, 1999.
DOI : 10.1016/S0097-8493(99)00093-X

J. H. Clark, Hierarchical geometric models for visible surface algorithms, Communications of the ACM, vol.19, issue.10, pp.547-554, 1976.
DOI : 10.1145/360349.360354

C. K. The, J. Daubert, H. Kautz, W. Seidel, J. Heidrich et al., Efficient light transport using precomputed visibility, Computer Graphics and Applications, issue.3, pp.2328-2365, 2003.

M. Berg, Ray Shooting, Depth Orders and Hidden Surface Removal, Lecture Notes in Computer Science, vol.703, 1993.
DOI : 10.1007/BFb0029813

J. Demouth, Événements visuels et limites d'ombres, 2008.

J. Demouth and X. Goaoc, Computing direct shadows cast by convex polyhedra, Proceedings of the 25nd European Workshop on Computational Geometry, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00431544

O. Devillers, V. Dujmovi?, H. Everett, X. Goaoc, S. Lazard et al., 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

O. Devillers, M. Glisse, and S. Lazard, Predicates for line transversals to lines and line segments in three-dimensional space, Proceedings of the twenty-fourth annual symposium on Computational geometry , SCG '08, 2008.
DOI : 10.1145/1377676.1377704

URL : https://hal.archives-ouvertes.fr/inria-00336256

D. P. Dobkin and D. G. Kirkpatrick, Determining the separation of preprocessed polyhedra ??? A unified approach, Proceedings of the 17th International Colloquium on Automata, Languages and Programming, pp.400-413, 1990.
DOI : 10.1007/BFb0032047

S. E. Dorward, A SURVEY OF OBJECT-SPACE HIDDEN SURFACE REMOVAL, International Journal of Computational Geometry & Applications, vol.04, issue.03, pp.325-362, 1994.
DOI : 10.1142/S0218195994000185

M. Drumheller, Mobile Robot Localization Using Sonar, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.9, issue.2, pp.325-332, 1987.
DOI : 10.1109/TPAMI.1987.4767907

F. Duguet, Implémentation robuste du squelette de visibilité, 2001.

F. Duguet and G. Drettakis, Robust epsilon visibility, Proceedings of the 29th annual conference on Computer graphics and interactive techniques (SIG- GRAPH'02), pp.567-575, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00606723

F. Durand, Visibilité tridimensionnelle : étude analytique et applications, 1999.

F. Durand, G. Drettakis, and C. Puech, The 3D visibility complex, Proceedings of the 9th Canadian Conference on Computational Geometry (CCCG'97), pp.153-158, 1997.
DOI : 10.1145/508357.508362

URL : https://hal.archives-ouvertes.fr/inria-00606717

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, 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. 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, Computational Geometry, vol.38, issue.3, pp.129-138, 2007.
DOI : 10.1016/j.comgeo.2006.12.003

H. Everett, S. Lazard, B. Lenhart, and L. Zhang, On the degree of standard geometric predicates for line transversals in 3D, Computational Geometry, vol.42, issue.5, pp.484-494, 2009.
DOI : 10.1016/j.comgeo.2007.11.002

URL : https://hal.archives-ouvertes.fr/inria-00431441

H. Everett, S. Lazard, S. Petitjean, and L. Zhang, ON THE EXPECTED SIZE OF THE 2D VISIBILITY COMPLEX, International Journal of Computational Geometry & Applications, vol.17, issue.04, pp.361-382, 2007.
DOI : 10.1142/S0218195907002380

URL : https://hal.archives-ouvertes.fr/inria-00103926

J. D. Foley, A. Van-dam, S. K. Feiner, and J. F. Hughes, Computer graphics: principles and practice, 1995.

H. Fuchs, Z. M. Kedem, and B. F. Naylor, On visible surface generation by a priori tree structures, Proceedings of the 7th annual conference on Computer graphics and interactive techniques (SIGGRAPH'80), pp.124-133, 1980.

T. Funkhouser, N. Tsingos, I. Carlbom, G. Elko, M. Sondhi et al., A beam tracing method for interactive architectural acoustics, The Journal of the Acoustical Society of America, vol.115, issue.2, pp.739-756, 2004.
DOI : 10.1121/1.1641020

URL : https://hal.archives-ouvertes.fr/inria-00606736

S. K. Ghosh and D. M. Mount, An Output-Sensitive Algorithm for Computing Visibility Graphs, SIAM Journal on Computing, vol.20, issue.5, pp.888-910, 1991.
DOI : 10.1137/0220055

M. Glisse, Combinatoire des droites et segments pour la visibilité 3D, Thèse d'université, 2007.

M. Glisse and S. Lazard, An upper bound on the average size of silhouettes, Proceedings of the twenty-second annual symposium on Computational geometry , SCG '06, pp.241-257, 2008.
DOI : 10.1145/1137856.1137874

URL : https://hal.archives-ouvertes.fr/inria-00095282

X. Goaoc, Structures de visibilité globales : tailles, calculs et dégénérescences, Thèse d'université, 2004.

C. Goral, K. Torrance, D. Greenberg, and B. Battaile, Modelling the interaction of light between diffuse surfaces, Computer Graphics Proceedings, Annual Conference Series Proceedings of SIGGRAPH'84, pp.212-222, 1984.

R. L. Graham, B. D. Luboachevsky, K. J. Nurmela, and P. R. Östergård, Dense packings of congruent circles in a circle, Discrete Mathematics, vol.181, issue.1-3, pp.139-154, 1998.
DOI : 10.1016/S0012-365X(97)00050-2

O. Hall-holt, Kinetic Visibility, 2002.

J. Hasenfratz, M. Lapierre, N. Holzschuch, and F. Sillion, A Survey of Real-time Soft Shadows Algorithms, Computer Graphics Forum, vol.10, issue.6, pp.753-774, 2003.
DOI : 10.1111/j.1467-8659.2003.00722.x

URL : https://hal.archives-ouvertes.fr/inria-00281388

A. Hatcher, Algebraic Topology, 2002.

T. He, L. Hong, D. Chen, and Z. Liang, Reliable path for virtual endoscopy: ensuring complete examination of human organs, IEEE Transactions on Visualization and Computer Graphics, vol.7, issue.4, pp.333-342, 2001.

P. Heckbert, Discontinuity meshing for radiosity, Proceedings of the 3rd Eurographics Workshop on Rendering (EGRW'92), pp.203-216, 1992.

S. Hert, M. Hoffmann, L. Kettner, S. Pion, and M. Seel, An adaptable and extensible geometry kernel, Proceedings of the 5th Workshop on Algorithm Engineering (WAE'01), volume 2141 of Lecture Notes in Computer Science, pp.76-91, 2001.
DOI : 10.1016/j.comgeo.2006.11.004

URL : https://hal.archives-ouvertes.fr/inria-00344964

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

S. Hornus, Maintenance de la visibilité depuis un point mobile, et applications, 2006.

L. Kettner and E. Welzl, Contour Edge Analysis for Polyhedron Projections, Geometric Modeling: Theory and Practice, pp.379-394, 1997.
DOI : 10.1007/978-3-642-60607-6_25

D. E. Knuth, II: Seminumerical Algorithms, The Art of Computer Programming, 1973.
DOI : 10.1145/1088322.1088323

S. Laine, T. Aila, U. Assarsson, J. Lehtinen, and T. Akenine-möller, Soft shadow volumes for ray tracing, ACM Transactions on Graphics, vol.24, issue.3, pp.1156-1165, 2005.
DOI : 10.1145/1073204.1073327

URL : https://hal.archives-ouvertes.fr/inria-00510157

J. C. Latombe, Robot Motion Planning, 1991.
DOI : 10.1007/978-1-4615-4022-9

J. Lehtinen, S. Laine, and T. Aila, An Improved Physically-Based Soft Shadow Volume Algorithm, Computer Graphics Forum, vol.6, issue.9, pp.303-312, 2006.
DOI : 10.1109/38.62693

D. Lischinski, B. Smits, and D. P. Greenberg, Bounds and error estimates for radiosity, Proceedings of the 21st annual conference on Computer graphics and interactive techniques , SIGGRAPH '94, pp.67-74, 1994.
DOI : 10.1145/192161.192176

K. Mehlhorn, Data structures and algorithms 3: multi-dimensional searching and computational geometry, 1984.
DOI : 10.1007/978-3-642-69900-9

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

S. Nirenstein, E. Blake, and J. Gain, Exact from-region visibility culling, Proceedings of the 13th Eurographics Workshop on Rendering (EGRW'02), pp.191-202, 2002.

J. O-'rourke, Computational Geometry in C, 1998.

R. Orti, F. Durand, S. Rivière, and C. Puech, Using the visibility complex for radiosity computation, Proceedings of the ACM Workshop on Applied Computational Geometry, 1996.
DOI : 10.1007/BFb0014495

URL : https://hal.archives-ouvertes.fr/inria-00510118

R. Orti, S. Rivière, F. Durand, and C. Puech, Radiosity for dynamic scenes in flatland with the visibility complex, Computer Graphics Forum: Proceedings Eurographics'96, pp.237-248, 1996.
DOI : 10.1111/1467-8659.1530237

URL : https://hal.archives-ouvertes.fr/inria-00510115

S. Parker, P. Shirley, and B. Smits, Single sample soft shadows, 1998.

M. Pellegrini, Ray shooting on triangles in 3-space, Algorithmica, vol.4, issue.5, pp.471-494, 1993.
DOI : 10.1007/BF01187036

S. Petitjean, Computing exact aspect graphs of curved objects bounded by smooth algebraic surfaces, 1992.

S. Petitjean, J. Ponce, and D. J. Kriegman, Computing exact aspect graphs of curved objects: Algebraic surfaces, International Journal of Computer Vision, vol.23, issue.6, pp.231-255, 1992.
DOI : 10.1007/BF00133703

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

O. A. Platonova, Singularities of the mutual disposition of a surface and a line, Russian Mathematical Surveys, vol.36, issue.1, pp.248-249, 1981.
DOI : 10.1070/RM1981v036n01ABEH002556

M. Pocchiola and G. Vegter, Topologically sweeping visibility complexes via pseudo-triangulations. Discrete and Computational Geometry, Proceedings of the 11th ACM Annual Symposium on Computational Geometry (SoCG'95), pp.419-453, 1996.
DOI : 10.1007/bf02712876

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.9715

M. Pocchiola and G. Vegter, THE VISIBILITY COMPLEX, Proceedings of the 9th ACM Annual Symposium on Computational Geometry (SoCG'93), pp.279-308, 1996.
DOI : 10.1142/S0218195996000204

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

J. H. Rieger, On the classification of views of piecewise smooth objects, Image and Vision Computing, vol.5, issue.2, pp.91-97, 1987.
DOI : 10.1016/0262-8856(87)90033-3

J. H. Rieger, The geometry of view space of opaque objects bounded by smooth surfaces, Artificial Intelligence, vol.44, issue.1-2, pp.1-40, 1990.
DOI : 10.1016/0004-3702(90)90097-J

S. Rivière, Topologically sweeping the visibility complex of polygonal scenes, Proceedings of the eleventh annual symposium on Computational geometry , SCG '95, pp.36-37, 1995.
DOI : 10.1145/220279.220339

S. Rivière, Dynamic visibility in polygonal scenes with the visibility complex, Proceedings of the thirteenth annual symposium on Computational geometry , SCG '97, pp.421-423, 1997.
DOI : 10.1145/262839.263057

G. Schaufler, J. Dorsey, X. Decoret, and F. Sillion, Conservative volumetric visibility with occluder fusion, Proceedings of the 27th annual conference on Computer graphics and interactive techniques , SIGGRAPH '00, pp.229-238, 2000.
DOI : 10.1145/344779.344886

URL : https://hal.archives-ouvertes.fr/inria-00510056

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

M. Sharir, Algorithmic motion planning, Handbook of Discrete and Computational Geometry, pp.733-754, 1997.
DOI : 10.1201/9781420035315.ch47

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.6292

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

P. Srinivasan, P. Liang, and S. Hackwood, Computational geometric methods in volumetric intersection for 3D reconstruction, Pattern Recognition, vol.23, issue.8, pp.843-857, 1990.
DOI : 10.1016/0031-3203(90)90131-4

I. E. Sutherland, R. F. Sproull, and R. A. Schumacker, A Characterization of Ten Hidden-Surface Algorithms, ACM Computing Surveys, vol.6, issue.1, pp.1-55, 1974.
DOI : 10.1145/356625.356626

K. A. Tarabanis, P. K. Allen, and R. Y. Tsai, A survey of sensor planning in computer vision A ray tracing algorithm for progressive radiosity, Computer Graphics Proceedings, Annual Conference Series Proceedings of SIGGRAPH'89, pp.86-104315, 1989.

T. Whitted, An improved illumination model for shaded display, Computer Graphics Proceedings, Annual Conference Series Proceedings of SIGGRAPH'79, p.14, 1979.

. Wikipedia, Cw complex ? wikipedia, the free encyclopedia, 2009.

P. Wonka, M. Wimmer, and D. Schmalstieg, Visibility Preprocessing with Occluder Fusion for Urban Walkthroughs, Proceedings of the Eurographics Workshop on Rendering (EGRW'00), pp.71-82, 2000.
DOI : 10.1007/978-3-7091-6303-0_7

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

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

L. Zhang, H. Everett, S. Lazard, C. Weibel, and S. Whitesides, On the Size of the 3D Visibility Skeleton: Experimental Results, Proceedings of the 16th Annual European Symposium on Algorithms (ESA'08), pp.805-816, 2008.
DOI : 10.1007/978-3-540-87744-8_67

URL : https://hal.archives-ouvertes.fr/inria-00336502

L. Zhang, H. Everett, S. Lazard, and S. Whitesides, Towards an implementation of the 3D visibility skeleton, Proceedings of the twenty-third annual symposium on Computational geometry , SCG '07, 2007.
DOI : 10.1145/1247069.1247094

URL : https://hal.archives-ouvertes.fr/inria-00338095