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

G. [. Duguet and . Drettakis, Robust epsilon visibility, SIGGRAPH, pp.567-575, 2002.
DOI : 10.1145/566570.566618
URL : https://hal.archives-ouvertes.fr/inria-00606723

M. [. Devillers, X. Glisse, and . Goaoc, Complexity analysis of random geometric structures made simpler, Proceedings of the 29th annual symposium on Symposuim on computational geometry, SoCG '13, 2013.
DOI : 10.1145/2462356.2462362
URL : https://hal.archives-ouvertes.fr/hal-00761171

L. [. Efrat, O. A. Guibas, L. Hall-holt, and . Zhang, On incremental rendering of silhouette maps of a polyhedral scene, Proc. of the 11th Symposium on Discrete Algorithms, SODA'00, pp.910-917, 2000.
DOI : 10.1016/j.comgeo.2006.12.003

M. Franceschetti, O. Dousse, D. N. Tse, and P. Thiran, Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory, IEEE Transactions on Information Theory, vol.53, issue.3, pp.1009-1018, 2007.
DOI : 10.1109/TIT.2006.890791

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

]. S. Jan04 and . Janson, Large deviations for sums of partly dependent random variables. Random Struct, Algorithms, vol.24, issue.3, pp.234-248, 2004.

E. [. Kettner and . 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

]. M. Mcg04 and . Mcguire, Observations on silhouette sizes, Journal of Graphics Tools, vol.9, issue.1, pp.1-12, 2004.

. V. Sgg-+-00-]-p, X. Sander, S. J. Gu, H. Gortler, J. Hoppe et al., Silhouette clipping, SIGGRAPH, pp.327-334, 2000.