. Cazals, Filtering, clustering and hierarchy construction: a new solution for ray-tracing complex scenes, Eurographics'95, 1995.

S. Cazals, F. Cazals, and M. Sbert, Some integral geometry tools to estimate the complexity of 3d scenes, 1997.
URL : https://hal.archives-ouvertes.fr/inria-00073485

H. Edelsbrunner, Algorithms in Combinatorial Geometry, 1986.
DOI : 10.1007/978-3-642-61568-9

. Foley, Computer Graphics: Principles and Practice, 1990.

S. Guibas, L. Guibas, and R. Seidel, Computing convolutions by reciprocal search. Discrete and computational geometry, pp.175-193, 1987.

D. Knuth, The art of computer programming -I, 1973.

. Latombe, Assembly sequencing with toleranced parts, Computer Aided Design, 1996.
DOI : 10.2172/90199
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.274

B. Messerve, Double Factorials, The American Mathematical Monthly, vol.55, issue.7, pp.425-426, 1948.
DOI : 10.2307/2306136

B. Natarajan, On planning assemblies, Proceedings of the fourth annual symposium on Computational geometry , SCG '88, 1988.
DOI : 10.1145/73393.73424

J. Riordan, The distribution of crossings chords joining pairs of 2n points on a circle, Mathematics of Computation, pp.215-222, 1975.

P. Sloane, N. Sloane, and S. Plouffe, The Encyclopedia of Integer Sequences, 1995.

J. Touchard, Contribution ?? l'??tude du probl??me des timbres poste, Journal canadien de math??matiques, vol.2, issue.0, pp.385-398, 1950.
DOI : 10.4153/CJM-1950-035-6

. Wilson, R. Wilson, and J. Latombe, Geometric reasoning about mechanical assembly, Artificial Intelligence, vol.71, issue.2, pp.371-396, 1994.
DOI : 10.1016/0004-3702(94)90048-5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.4892

A. Yaglom and I. Yaglom, Challenging mathematical problems with elementary solutions, 1964.

P. Zimmermann, Gaia: a package for the random generation of combinatorial structures, Maple Technical Newsletter, vol.1, issue.1, pp.1-9, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00917745