. Proof, P. For-two-sites, Q. ?. Consider-the-diagram, F. {p, and Q. , A pure vertex at infinity corresponds to an edge of CH(P ? Q) supported by a corner of P and a corner of Q. But CH(P ? Q) can have at most two such edges, since P and Q are disjoint and both are connected, and so F({P, Q}) has at most two pure vertices at infinity. Consider now again F(S), and let ?(S) denote the sequence of sites whose Voronoi regions appear at infinity in circular order, starting and ending at the same region, We claim that ?(S) is a Davenport-Schinzel sequence of order 2, and has therefore length at most 2k ? 1 [98]. Indeed, ?(S) has by definition no two consecutive identical symbols

M. Abellanas, F. Hurtado, C. Icking, R. Klein, E. Langetepe et al., Smallest Color-Spanning Objects, Proc. 9th Annu. European Sympos. Algorithms, pp.278-289
DOI : 10.1007/3-540-44676-1_23
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.2405

P. K. Agarwal, On stabbling lines for convex polyhedra in 3D, Computational Geometry, vol.4, issue.4, pp.177-189, 1994.
DOI : 10.1016/0925-7721(94)90016-7

P. K. Agarwal, B. Aronov, and M. Sharir, On lines avoiding unit balls in three dimensions, Proceedings of the 20th ACM Annual Symposium on Computational Geometry, pp.36-45, 2004.

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

M. Alexa, M. Gross, H. Pfister, and S. Rusinkiewicz, Eurographics, symposium on point-based graphics, 2004.

H. Alt, M. Glisse, and X. Goaoc, On the worst-case complexity of the silhouette of a polytope, 15th Canadian Conference on Computational Geometry -CCCG'03, pp.51-55, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00099478

N. Amenta, Helly theorems and generalized linear programming, Proceedings of the ninth annual symposium on Computational geometry , SCG '93, 1993.
DOI : 10.1145/160985.161000

N. Amenta, Helly-type theorems and Generalized Linear Programming, Discrete & Computational Geometry, vol.4, issue.no. 1, 1994.
DOI : 10.1007/BF02574379
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.4035

B. Aronov, H. Brönnimann, A. Y. Chang, and Y. Chiang, Cost-driven octree construction schemes, Proceedings of the nineteenth conference on Computational geometry , SCG '03, pp.127-148, 2005.
DOI : 10.1145/777792.777827

B. Aronov, H. Brönnimann, A. Y. Chang, and Y. Chiang, Cost prediction for ray shooting in octrees, Computational Geometry, vol.34, issue.3, pp.159-181, 2006.
DOI : 10.1016/j.comgeo.2005.09.002

B. Aronov, H. Brönnimann, A. Y. Chang, and Y. Chiang, Cost prediction for ray shooting, Proceedings of the eighteenth annual symposium on Computational geometry , SCG '02, pp.293-302, 2002.
DOI : 10.1145/513400.513438

B. Aronov and S. J. Fortune, Approximating Minimum-Weight Triangulations in Three Dimensions, Discrete & Computational Geometry, vol.21, issue.4, pp.527-549, 1999.
DOI : 10.1007/PL00009436

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

F. Aurenhammer and R. Klein, Voronoi diagrams, Handbook of Computational Geometry, pp.201-290, 2000.

F. Aurenhammer, R. L. Drysdale, and H. Krasser, Farthest line segment Voronoi diagrams, Information Processing Letters, vol.100, issue.6, pp.220-225, 2006.
DOI : 10.1016/j.ipl.2006.07.008
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.2064

K. Ball, Cube Slicing in R n, Proc. Amer, pp.465-473, 1986.
DOI : 10.2307/2046239

M. Bern, D. P. Dobkin, D. Eppstein, and R. Grossman, Visibility with a moving point of view, Algorithmica, vol.3, issue.4, pp.360-378, 1994.
DOI : 10.1007/BF01187019

M. Bern and D. Eppstein, Mesh generation and optimal triangulation, Computing in Euclidean Geometry, 1992.

H. L. Bertoni, Radio Propagation for Modern Wireless Systems, 1999.

J. Boissonnat and S. Oudot, Provably good sampling and meshing of surfaces. Graphical Models, special issue of Solid Modeling, pp.405-451, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00488829

J. Boissonnat and M. Yvinec, Algorithmic Geometry, 1998.
DOI : 10.1017/CBO9781139172998

C. Borcea, X. Goaoc, S. Lazard, and S. Petitjean, 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

H. Brönnimann, O. Devillers, V. Dujmovi?, H. Everett, M. Glisse et al., On the number of lines tangent to four convex polyhedra, Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG'02), pp.113-117, 2002.

H. Brönnimann, O. Devillers, V. Dujmovi?, H. Everett, M. Glisse et al., The number of lines tangent to arbitrary polytopes in R 3, Proceedings of the 20th ACM Annual Symposium on Computational Geometry, pp.46-55, 2004.

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, S. Whitesides et al., Transversals to Line Segments in Three-Dimensional Space, Proc. 6th Latin American Symposium on Theoretical Informatics, pp.381-390, 2004.
DOI : 10.1007/s00454-005-1183-1

H. Brönnimann, M. Glisse, and D. Wood, Cost-optimal quadtrees for ray shooting, Proc. 14th Canadian Conference on Computational Geometry, 2002.

H. Bronnimann and M. T. Goodrich, Almost optimal set covers in finite VC-dimension, Discrete & Computational Geometry, vol.16, issue.2, pp.463-479, 1995.
DOI : 10.1007/BF02570718

F. Cazals and C. Puech, Bucket-like space partitioning data structures with applications to ray-tracing, Proceedings of the thirteenth annual symposium on Computational geometry , SCG '97, pp.11-20, 1997.
DOI : 10.1145/262839.262851
URL : https://hal.archives-ouvertes.fr/inria-00510092

A. Y. Chang, Theoretical and experimental aspects of ray shooting, 2004.

O. Cheong, H. Everett, M. Glisse, J. Gudmundsson, S. Hornus et al., Farthest-polygon voronoi diagrams, Proceedings of the 15th Annual European Symposium on Algorithms, p.12, 2007.
DOI : 10.1016/j.comgeo.2010.11.004
URL : https://hal.archives-ouvertes.fr/inria-00189038

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

K. L. Clarkson and K. Varadarajan, Improved Approximation Algorithms for Geometric Set Cover, Discrete & Computational Geometry, vol.37, issue.1, pp.43-58, 2007.
DOI : 10.1007/s00454-006-1273-8
URL : http://arxiv.org/abs/cs/0501045

J. G. Cleary and G. Wyvill, Analysis of an algorithm for fast ray tracing using uniform space subdivision. The Visual Computer, pp.65-83, 1988.

R. Cole and M. Sharir, 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 : http://doi.org/10.1016/s0747-7171(89)80003-3

D. Cox, J. Little, and D. Shea, Ideals, Varieties and Algorithms. An Introduction to Computational Algebraic Geometry and Commutative Algebra, Undergraduate Texts in Mathematics, 1992.

M. De-berg, H. Everett, and L. Guibas, 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

M. De-berg, D. Halperin, M. Overmars, and M. Van-kreveld, Sparse Arrangements and the Number of Views of Polyhedral Scenes, International Journal of Computational Geometry & Applications, vol.07, issue.03, pp.175-195, 1997.
DOI : 10.1142/S0218195997000120

M. De-berg, M. Van-kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry : Algorithms and Applications, 2000.

E. Demaine, J. Mitchell, and J. O-'rourke, The open problems project ? problem, p.61

J. Demouth, O. Devillers, H. Everett, M. Glisse, S. Lazard et al., Between umbra and penumbra, Proceedings of the twenty-third annual symposium on Computational geometry , SCG '07, 2007.
DOI : 10.1145/1247069.1247117
URL : https://hal.archives-ouvertes.fr/inria-00187253

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

D. P. Dobkin and D. G. Kirkpatrick, Fast detection of polyhedral intersection, Theoretical Computer Science, vol.27, issue.3, pp.241-253, 1983.
DOI : 10.1016/0304-3975(82)90120-7

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

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. Duguet, Implémentation robuste du squelette de visibilité, 2001.

F. Duguet, Shadow computations using robust epsilon visibility, Research Report, vol.5167, 2004.
DOI : 10.1145/566654.566618
URL : https://hal.archives-ouvertes.fr/inria-00071422

F. Duguet and G. Drettakis, Robust epsilon visibility, Proceedings of ACM SIGGRAPH 2002, pp.567-575, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00606723

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

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

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

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

H. Edelsbrunner, L. J. Guibas, and J. Stolfi, Optimal Point Location in a Monotone Subdivision, SIAM Journal on Computing, vol.15, issue.2, 1986.
DOI : 10.1137/0215023

A. Efrat, L. Guibas, O. Hall-holt, and L. Zhang, On incremental rendering of silhouette maps of a polyhedral scene, Also in Proceedings of SODA'00), pp.129-138, 2007.
DOI : 10.1016/j.comgeo.2006.12.003

H. Everett, S. Lazard, B. Lenhart, J. Redburn, and L. Zhang, Predicates for line transversals in 3D, Accepted in Computational Geometry : Theory and Applications . (Also in Proceedings of 18th Canadian Conference on Computational Geometry -CCCG'06.), 2006.
URL : https://hal.archives-ouvertes.fr/inria-00103945

S. J. Fortune, A sweepline algorithm for Voronoi diagrams, Algorithmica, vol.14, issue.1-4, pp.153-174, 1987.
DOI : 10.1007/BF01840357

A. S. Glassner, An introduction to ray tracing An upper bound on the average size of silhouettes, Proceedings of the 22nd ACM Annual Symposium on Computational Geometry (SoCG'06), pp.105-111, 1989.

M. Glisse and H. Brönnimann, Octrees with near optimal cost for ray-shooting, Computational Geometry : Theory and Applications, vol.34, issue.3, pp.182-194, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00000514

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

J. Goldsmith and J. Salmon, Automatic Creation of Object Hierarchies for Ray Tracing, IEEE Computer Graphics and Applications, vol.7, issue.5, pp.14-20, 1987.
DOI : 10.1109/MCG.1987.276983

D. Halperin and M. Sharir, 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

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

V. Havran, J. Prikryl, and J. Bittner, The best efficiency scheme, 2000.

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

E. Helly, Über Mengen konvexer Körper mit gemeinschaftlichen Punkten, Jahresbericht Deutsch. Math. Verein, vol.32, pp.175-176, 1923.

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

D. P. Huttenlocher, K. Kedem, and M. Sharir, The upper envelope of voronoi surfaces and its applications, Discrete & Computational Geometry, vol.2, issue.3, pp.267-291, 1993.
DOI : 10.1007/BF02189323

T. Isenberg, B. Freudenberg, N. Halper, S. Schlechtweg, and T. Strothotte, A developer's guide to silhouette algorithms for polygonal models, IEEE Computer Graphics and Applications, vol.23, issue.4, pp.28-37, 2003.
DOI : 10.1109/MCG.2003.1210862

S. Jadhav, A. Mukhopadhyay, and B. K. Bhattacharya, An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons, Journal of Algorithms, vol.20, issue.2, pp.244-267, 1996.
DOI : 10.1006/jagm.1996.0013

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

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

C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, Journal of the ACM, vol.41, issue.5, pp.960-981, 1994.
DOI : 10.1145/185675.306789

D. J. Macdonald and K. S. Booth, Heuristics for ray tracing using space subdivision, The Visual Computer, vol.3, issue.3, pp.153-166, 1990.
DOI : 10.1007/BF01911006

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

M. Mcguire, Observations on Silhouette Sizes, Journal of Graphics Tools, vol.1, issue.2, pp.1-12, 2004.
DOI : 10.1080/10867651.2004.10487594

N. Megiddo, Applying Parallel Computation Algorithms in the Design of Serial Algorithms, Journal of the ACM, vol.30, issue.4, pp.852-865, 1983.
DOI : 10.1145/2157.322410

K. Mehlhorn, S. Meiser, and R. Rasch, FURTHEST SITE ABSTRACT VORONOI DIAGRAMS, International Journal of Computational Geometry & Applications, vol.11, issue.06, pp.583-616, 2001.
DOI : 10.1142/S0218195901000663

D. W. Moore, Simplicial mesh generation with applications, 1992.

K. Mulmuley, A fast planar partition algorithm, I, Journal of Symbolic Computation, vol.10, issue.3-4, pp.253-280, 1990.
DOI : 10.1016/S0747-7171(08)80064-8

B. Naylor, Constructing good partitioning trees, Proceedings of Graphics Interface (GI'93), pp.181-191, 1993.

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.

J. O. Rourke, Computational Geometry in C, 1998.

M. Pellegrini, On lines missing polyhedral sets in 3-space, Discrete & Computational Geometry, vol.8, issue.1, pp.203-221, 1994.
DOI : 10.1007/BF02574376

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

E. Reinhard, A. J. Kok, and F. W. Jansen, Cost Prediction in Ray Tracing, Rendering Techniques '96 (Proceedings of the Seventh Eurographics Workshop on Rendering), pp.41-50, 1996.
DOI : 10.1007/978-3-7091-7484-5_5

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

H. Samet, The design and analysis of spatial data structures, 1990.

P. V. Sander, X. Gu, S. J. Gortler, H. Hoppe, and J. Snyder, Silhouette clipping, Proceedings of the 27th annual conference on Computer graphics and interactive techniques , SIGGRAPH '00, pp.327-334, 2000.
DOI : 10.1145/344779.344935

L. A. Santalo, Integral Geometry and Geometric Probability, 2004.
DOI : 10.1017/cbo9780511617331

H. A. Schwarz, Sur une définition erronée de l'aire d'une surface courbe, Gesammelte Mathematische Abhandlungen, pp.309-311, 1890.

R. Seidel, Small-dimensional linear programming and convex hulls made easy, 98] M. Sharir and P. K. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications, pp.423-434, 1991.
DOI : 10.1007/BF02574699
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.5290

M. Sharir and P. K. Agarwal, Davenport-Schinzel Sequences and their Geometric Applications, 1995.
DOI : 10.1007/978-3-642-83539-1_9
URL : http://biogeometry.duke.edu/pubs-pankaj/surveys/ds-survey.ps.gz

M. Sharir and E. Welzl, A combinatorial bound for linear programming and related problems, STACS '92 : Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science, pp.569-579, 1992.
DOI : 10.1007/3-540-55210-3_213

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

J. Stolfi, Oriented projective geometry, Proceedings of the third annual symposium on Computational geometry , SCG '87, 1991.
DOI : 10.1145/41958.41966

K. R. Subramanian and D. S. Fussell, Automatic termination criteria for ray tracing hierarchies, Proceedings of Graphics Interface '91, pp.93-100, 1991.

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

M. Van-kreveld and T. Schlechter, Automated label placement for groups of islands, Proc. of the 22nd International Cartographic Conference, 2005.

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.

H. Weghorst, G. Hooper, and D. P. Greenberg, Improved Computational Methods for Ray Tracing, ACM Transactions on Graphics, vol.3, issue.1, pp.52-69, 1984.
DOI : 10.1145/357332.357335

K. Whang, J. Song, J. Chang, J. Kim, W. Cho et al., Octree-R: an adaptive octree for efficient ray tracing, IEEE Transactions on Visualization and Computer Graphics, vol.1, issue.4, pp.343-349, 1995.
DOI : 10.1109/2945.485621

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

C. Yap, Towards exact geometric computation, Computational Geometry, vol.7, issue.1-2, pp.3-23, 1997.
DOI : 10.1016/0925-7721(95)00040-2