1. Agarwal, P. K., Guibas, L. J., Har-Peled, S., Rabinovitch, A., & Sharir, M. (2000). Penetration depth of two convex polytopes in 3d. Nordic Journal of Computing, 7(3), 227–240. URL http://dl.acm.org/citation.cfm?id=642992.642999 .
2. Albocher, D., Sarel, U., Choi, Y.-K., Elber, G., & Wang, W. (2006). Efficient continuous collision detection for bounding boxes under rational motion. In ICRA (pp. 3017–3022). New York: IEEE. URL http://dblp.uni-trier.de/db/conf/icra/icra2006.html .
3. Amanatides, J., & Woo, A. (1987). A fast voxel traversal algorithm for ray tracing. In Eurographics 1987 (pp. 3–10).
4. Andrysco, N., & Tricoche, X. (2011). Implicit and dynamic trees for high performance rendering. In Proceedings of graphics interface 2011, GI ’11, School of Computer Science, University of Waterloo, Waterloo, Ontario (pp. 143–150). Waterloo: Canadian Human-Computer Communications Society. ISBN 978-1-4503-0693-5. URL http://dl.acm.org/citation.cfm?id=1992917.1992941 .
5. Arvo, J., & Kirk, D. (1989). A survey of ray tracing acceleration techniques. In A. S. Glassner (Ed.), An introduction to ray tracing (pp. 201–262). London: Academic Press Ltd. ISBN 0-12-286160-4. URL http://dl.acm.org/citation.cfm?id=94788.94794 .