D. Landau and K. Binder, A guide to Monte Carlo simulations in statistical physics, 2014.

C. Robert and G. Casella, Monte Carlo statistical methods, 2013.

S. Brooks, A. Gelman, G. Jones, and X. Meng, Handbook of Markov Chain Monte Carlo, 2011.

M. Betancourt, A conceptual introduction to Hamiltonian Monte Carlo, 2017.

N. Radford, MCMC using Hamiltonian Dynamics, Handbook of Markov Chain Monte Carlo, pp.113-162, 2012.

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

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

I. Bárány and Z. Füredi, Computing the volume is difficult, Discrete & Computational Geometry, vol.2, issue.4, pp.319-326, 1987.

S. Levy, Flavors of Geometry, 1997.

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

L. László, S. Lovász, and . Vempala, Simulated annealing in convex bodies and an O * (n 4 ) volume algorithm, Journal of Computer and System Sciences, vol.72, issue.2, pp.392-417, 2006.

B. Cousins and S. Vempala, A practical volume algorithm, Mathematical Programming Computation, vol.8, issue.2, pp.133-160, 2016.

B. Cousins and S. Vempala, Bypassing KLS: Gaussian cooling and an O * (n 3 ) volume algorithm, ACM STOC, pp.539-548, 2015.

B. Cousins and S. Vempala, Gaussian cooling and O * (n 3 ) algorithms for volume and gaussian volume, SIAM Journal on Computing, vol.47, issue.3, pp.1237-1273, 2018.

L. Lovász and R. Kannan, Faster mixing via average conductance, Proceedings of the Thirty-first Annual ACM Symposium on Theory of Computing, STOC '99, pp.282-287, 1999.

L. Lovász, Hit-and-run mixes fast, Mathematical Programming, Series B, vol.86, pp.443-461, 1999.

L. Lovász and S. Vempala, Hit-and-run is fast and fun. preprint, Microsoft Research, 2003.

L. Lovász and S. Vempala, Hit-and-run from a corner, Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of Computing, STOC '04, pp.310-314, 2004.

H. Haraldsdóttir, B. Cousins, I. Thiele, R. Fleming, and S. Vempala, CHRR: coordinate hit-and-run with rounding for uniform sampling of constraint-based models, Bioinformatics, vol.33, issue.11, pp.1741-1743, 2017.

E. Gryazinaa and B. Polyak, Random sampling: Billiard walk algorithm. arXiv, 2014.

I. Emiris and V. Fisikopoulos, Efficient random-walk methods for approximating polytope volume, Proceedings of the thirtieth annual symposium on Computational geometry, p.318, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01897272

I. Emiris and V. Fisikopoulos, Practical polytope volume approximation, ACM Trans. on Math. Software, vol.44, issue.4, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01897272

D. Levin and Y. Peres, Markov chains and mixing times, vol.107, 2017.

B. Polyak and E. N. Gryazina, Billiard walk-a new sampling algorithm for control and optimization, IFAC Proceedings Volumes, vol.47, pp.6123-6128, 2014.

F. Preparata and M. Shamos, Computational geometry: an introduction, 1985.

J. Muller, N. Brunie, F. De-dinechin, C. Jeannerod, M. Joldes et al., Handbook of floating-point arithmetic, 2018.
URL : https://hal.archives-ouvertes.fr/ensl-00379167

L. Kettner, K. Mehlhorn, S. Pion, S. Schirra, and C. Yap, Classroom examples of robustness problems in geometric computations, Computational Geometry, vol.40, issue.1, pp.61-78, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00344515

C. Yap and T. Dubé, The exact computation paradigm, Computing in Euclidean Geometry, pp.452-492, 1995.

. Cgal, Computational Geometry Algorithms Library

H. Afshar and J. Domke, Reflection, refraction, and Hamiltonian Monte Carlo, Advances in Neural Information Processing Systems, pp.3007-3015, 2015.

G. O. Roberts and J. S. Rosenthal, General state space Markov chains and MCMC algorithms, Probability Surveys, 2004.

J. V. Burke, Continuity and differentiability of solutions

A. Pakman and L. Paninski, Exact hamiltonian Monte Carlo for truncated multivariate gaussians, Journal of Computational and Graphical Statistics, vol.23, issue.2, pp.518-542, 2014.

N. Müller, The iRRAM: Exact arithmetic in C++, Computability and Complexity in Analysis, pp.222-252, 2001.

F. Cazals and T. Dreyfus, The Structural Bioinformatics Library: modeling in biomolecular science and beyond, Bioinformatics, vol.7, issue.33, pp.1-8, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01570848