P. K. Agarwal, S. Har-peled, and K. R. Varadarajan, Geometric approximation via coresets, Combinatorial and Computational Geometry, MSRI, pp.1-30, 2005.

A. Andoni and P. Indyk, Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions, Commun. ACM, vol.51, pp.117-122, 2008.
DOI : 10.1109/focs.2006.49
URL : http://theory.csail.mit.edu/~indyk/p117-andoni.pdf

S. Arya, G. Dias-da-fonseca, and D. M. Mount, Optimal area-sensitive bounds for polytope approximation, ACM Symp. on Comp. Geometry, pp.363-372, 2012.
DOI : 10.1145/2261250.2261305

R. Basri, T. Hassner, and L. Zelnik-manor, Approximate nearest subspace search, IEEE Trans. Pattern Analysis & Machine Intelligence, vol.33, issue.2, pp.266-278, 2011.
DOI : 10.1109/tpami.2010.110
URL : http://webee.technion.ac.il/%7Elihi/Publications/10-ANS-PAMI.pdf

M. Beck and D. Pixton, The Ehrhart polynomial of the Birkhoff polytope, Discrete & Computational Geometry, vol.30, issue.4, pp.623-637, 2003.
DOI : 10.1007/s00454-003-2850-8
URL : https://link.springer.com/content/pdf/10.1007%2Fs00454-003-2850-8.pdf

D. Bertsimas and S. Vempala, Solving convex programs by random walks, J. ACM, vol.51, issue.4, pp.540-556, 2004.
DOI : 10.1145/509907.509926
URL : http://www.csail.mit.edu/~jrennie/trg/papers/bertsimas-walks-04.ps.gz

U. Betke and M. Henk, Approximating the volume of convex bodies, Discrete & Computational Geometry, vol.10, issue.1, pp.15-21, 1993.
DOI : 10.1007/bf02573960
URL : https://link.springer.com/content/pdf/10.1007%2FBF02573960.pdf

B. Büeler, A. Enge, and . Vinci,

B. Büeler, A. Enge, and K. Fukuda, Exact volume computation for polytopes: A practical study, Polytopes: Combinatorics and Computation, vol.29, pp.131-154, 2000.

E. Canfield and B. Mckay, The asymptotic volume of the birkhoff polytope, Online Journal of Analytic Combinatorics, vol.4, issue.0, 2009.

, CGAL: Computational geometry algorithms library

B. Cousins and S. Vempala, A cubic algorithm for computing gaussian volume, SODA, pp.1215-1228, 2014.

B. Cousins and S. Vempala, A Matlab implementation for volume approximation of convex bodies, 2014.

J. A. De-loera, B. Dutra, M. Köppe, S. Moreinis, G. Pinto et al., Software for exact integration of polynomials over polyhedra, Comput. Geom.: Theory Appl, vol.46, issue.3, pp.232-252, 2013.

M. Dyer, A. Frieze, and R. Kannan, A random polynomial-time algorithm for approximating the volume of convex bodies, J. ACM, vol.38, issue.1, pp.1-17, 1991.

M. E. Dyer and A. M. Frieze, On the complexity of computing the volume of a polyhedron, SIAM J. Comput, vol.17, issue.5, pp.967-974, 1988.

G. Elekes, A geometric inequality and the complexity of computing volume, Discrete & Computational Geometry, vol.1, pp.289-292, 1986.

K. Fischer, B. Gärtner, T. Herrmann, M. Hoffmann, and S. Schönherr, Bounding volumes. In CGAL User and Reference Manual, 2013.

K. Fischer, B. Gärtner, S. Schönherr, and F. Wessendorp, Linear and quadratic programming solver, In CGAL User and Reference Manual. CGAL Editorial Board, 2013.

G. Guennebaud and B. Jacob, , vol.3, 2010.

U. , A Monte Carlo method for high-dimensional volume estimation and application to polytopes, Procedia Computer Science, vol.4, pp.1403-1411, 2011.

R. Kannan, L. Lovász, and M. Simonovits, Random walks and an O * (n 5 ) volume algorithm for convex bodies, Rand. Struct. Algor, vol.11, pp.1-50, 1997.

D. E. Kaufman and R. L. Smith, Direction choice for accelerated convergence in hit-and-run sampling, Operations Research, vol.46, pp.84-95, 1998.

L. G. Khachiyan, Rounding of polytopes in the real number model of computation, Math. Oper. Res, vol.21, issue.2, pp.307-320, 1996.

S. Liu, J. Zhang, and B. Zhu, Volume computation using a direct Monte Carlo method, LNCS, vol.4598, pp.198-209, 2007.

L. Lovász and I. Deák, Computational results of an O(n 4 ) volume algorithm, European J. Operational Research, vol.216, issue.1, pp.152-161, 2012.

L. Lovász and S. Vempala, Hit-and-run from a corner, SIAM J. Comput, vol.35, issue.4, pp.985-1005, 2006.

L. Lovász and S. Vempala, Simulated annealing in convex bodies and an O * (n 4 ) volume algorithm, J. Comp. Syst. Sci, vol.72, issue.2, pp.392-417, 2006.

J. Maurer, Boost: C++ Libraries

D. M. Mount and S. Arya, ANN: A library for approximate nearest neighbor searching, 1997.

M. Muja, Flann: Fast library for approximate nearest neighbors, 2011.

M. Muja and D. G. Lowe, Fast approximate nearest neighbors with automatic algorithm configuration, International Conference on Computer Vision Theory and Application VISSAPP'09), pp.331-340, 2009.

E. A. Ramos, On range reporting, ray shooting and k-level construction, Proc. Symposium on Computational Geometry, pp.390-399, 1999.

M. Simonovits, How to compute the volume in high dimension?, Math. Program, pp.337-374, 2003.

R. L. Smith, Efficient Monte Carlo procedures for generating points uniformly distributed over bounded regions, Operations Research, vol.32, issue.6, pp.1296-1308, 1984.

H. Tangelder and A. Fabri, dD spatial searching, In CGAL User and Reference Manual. CGAL Editorial Board, 2013.

Y. Zheng and K. Yamane, Ray-shooting algorithms for robotics, IEEE Trans. Automation Science & Engineering, vol.10, pp.862-874, 2013.