U. Assarsson and T. Möller, Optimized View Frustum Culling Algorithms for Bounding Boxes, Journal of Graphics Tools, vol.19, issue.10, 2000.
DOI : 10.1080/10867651.2000.10487517

L. Barba and S. Langerman, Optimal detection of intersections between convex polyhedra, Proceedings of the Annual Symposium on Discrete Algorithms (SODA). ACM- SIAM, 2015.
DOI : 10.1137/1.9781611973730.109

E. Berberich, E. Fogel, D. Halperin, M. Kerber, and O. Setter, Arrangements on Parametric Surfaces II: Concretizations and Applications, Mathematics in Computer Science, vol.6, issue.1, 2010.
DOI : 10.1007/s11786-010-0043-4

S. Boulos, I. Wald, and P. Shirley, Geometric and arithmetic culling methods for entire ray packets, 2006.

. Bullet, The Bullet physics library, 2015.

K. L. Clarkson, D. Eppstein, G. L. Miller, C. Sturtivant, and S. Teng, Approximating center points with iterated radon points, Proceedings of the ninth annual symposium on Computational geometry , SCG '93, 1996.
DOI : 10.1145/160985.161004

D. Eberly, Intersection of ellipsoids, 2008.

C. Ericson, Real-Time Collision Detection, 2004.

G. Elmer, C. Gilbert, and . Foo, Computing the distance between general convex objects in three-dimensional space, IEEE Journal of Robotics And Automation, vol.6, issue.1, pp.53-61, 1990.

E. G. Gilbert, D. W. Johnson, and S. Keerthi, A fast procedure for computing the distance between complex objects in three-dimensional space, IEEE Journal on Robotics and Automation, vol.4, issue.2, 1988.
DOI : 10.1109/56.2083

S. Gottschalk, Collision Queries using Oriented Bounded Boxes, 2000.

S. Gottschalk, M. C. Lin, and D. Manocha, OBBTree, Proceedings of the 23rd annual conference on Computer graphics and interactive techniques , SIGGRAPH '96, 1996.
DOI : 10.1145/237170.237244

N. Greene, Detecting Intersection of a Rectangular Solid and a Convex Polyhedron, Graphics Gems IV, chapter, pp.74-82, 1994.
DOI : 10.1016/B978-0-12-336156-1.50016-1

L. J. Guibas, A. Nguyen, and L. Zhang, Zonotopes as bounding volumes, Proceedings of the Annual Symposium on Discrete Algorithms (SODA). ACM-SIAM, 2003.

A. Eric, J. R. Haines, and . Wallace, Shaft culling for efficient ray-cast radiosity, Proceedings of the Second Workshop on Rendering. Eurographics, 1991.

P. Jiménez, F. Thomas, and C. Torras, 3D collision detection: a survey, Computers & Graphics, vol.25, issue.2, pp.269-285, 2001.
DOI : 10.1016/S0097-8493(00)00130-8

S. Pion and A. Fabri, A generic lazy evaluation scheme for exact geometric computations, Science of Computer Programming, vol.76, issue.4, pp.307-323, 2011.
DOI : 10.1016/j.scico.2010.09.003
URL : https://hal.archives-ouvertes.fr/inria-00089229

A. Reshetov, Faster Ray Packets - Triangle Intersection through Vertex Culling, 2007 IEEE Symposium on Interactive Ray Tracing, 2007.
DOI : 10.1109/RT.2007.4342597

I. Wald, S. Boulos, and P. Shirley, Ray tracing deformable scenes using dynamic bounding volume hierarchies, ACM Trans. Graph, vol.26, issue.1, 2007.

W. Wang, J. Wang, and M. Kim, An algebraic condition for the separation of two ellipsoids, Computer Aided Geometric Design, vol.18, issue.6, pp.531-539, 2001.
DOI : 10.1016/S0167-8396(01)00049-8