Skip to main content

Collision Detection


Collision detection is an integral component of game engines that are designed to provide realistic animations of object interactions with the player and the game environment. Physically realistic dynamic simulations such as flight simulators and mobile robot simulators also require efficient collision detection algorithms. Intersection tests form the backbone of collision detection algorithms. They are also used in ray tracing algorithms, acceleration algorithms such as view frustum culling and portal culling, and in real-time animations. This chapter gives an extensive coverage of methods used for testing if primitives and bounding volumes overlap.

Collision detection in a large scene consisting of several objects requires efficient methods to minimize the number of intersection tests. This chapter discusses the usefulness of bounding volume hierarchies and spatial partitioning trees such as octrees, k-d trees and bounding interval hierarchies, and includes a coverage of important algorithms in each category.


  • Convex Hull
  • Leaf Node
  • Child Node
  • Intersection Test
  • Collision Detection

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-1-4471-2340-8_9
  • Chapter length: 46 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
USD   44.99
Price excludes VAT (USA)
  • ISBN: 978-1-4471-2340-8
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   59.99
Price excludes VAT (USA)
Hardcover Book
USD   89.99
Price excludes VAT (USA)
Fig. 9.1
Fig. 9.2
Fig. 9.3
Listing 9.1
Fig. 9.4
Fig. 9.5
Fig. 9.6
Fig. 9.7
Fig. 9.8
Fig. 9.9
Fig. 9.10
Fig. 9.11
Fig. 9.12
Fig. 9.13
Fig. 9.14
Fig. 9.15
Fig. 9.16
Fig. 9.17
Fig. 9.18
Fig. 9.19
Fig. 9.20
Listing 9.2
Listing 9.3
Fig. 9.21
Fig. 9.22
Fig. 9.23
Fig. 9.24
Listing 9.4
Fig. 9.25
Fig. 9.26
Listing 9.5
Fig. 9.27
Listing 9.6
Fig. 9.28
Fig. 9.29


  • Cline, D., Steele, K., & Egbert, P. (2006). Lightweight bounding volumes for ray tracing. Journal of Graphics Tools, 11(4), 61–71.

    Google Scholar 

  • de Berg, M. (2000). Computational geometry: Algorithms and applications (2nd rev. ed.). New York: Springer.

    Google Scholar 

  • Eberly, D. H. (2007). 3D game engine design: A practical approach to real-time computer graphics (2nd ed.). Amsterdam/London: Morgan Kaufmann.

    Google Scholar 

  • Eberly, D. H. (2010). Game physics (2nd ed.). Burlington: Morgan Kaufmann/Elsevier.

    Google Scholar 

  • Ericson, C. (2005). Real-time collision detection. Amsterdam/Boston: Elsevier.

    Google Scholar 

  • Gottschalk, S., Lin, M. C., & Manocha, D. (1996). OBB-Tree: A hierarchical structure for rapid interference detection. In: Computer graphics (SIGGRAPH), New Orleans.

    Google Scholar 

  • Hapala, M., & Havran, V. (2011). Kd-tree traversal algorithms for ray tracing. Computer Graphics Forum, 30(1), 199–213.

    CrossRef  Google Scholar 

  • Kay, T. L., & Kajiya, J. T. (1986). Ray tracing complex scenes. In: Proceedings of computer graphics SIGGRAPH-86 (pp. 269–278).

    Google Scholar 

  • Klosowski, J. T., Held, M., et al. (1998). Efficient collision detection using bounding volume hierarchies of k-DOPs. IEEE Transactions on Visualization and Computer Graphics, 4(1), 21–36.

    CrossRef  Google Scholar 

  • Moller, T. (1997). A fast triangle-triangle intersection test. Journal of Graphics, GPU and Game Tools, 2(2), 25–30.

    Google Scholar 

  • Moller, T., Haines, E., & Hoffman, N. (2008). Real-time rendering (3rd ed.). Wellesley: A.K. Peters.

    CrossRef  Google Scholar 

  • O’Rourke, J. (1998). Computational geometry in C (2nd ed.). Cambridge: Cambridge University Press.

    MATH  CrossRef  Google Scholar 

  • Raabe, A., Tietjen, T., & Anlauf J. K. (2009). An exact and efficient triangle intersection test hardware. International conference on computer graphics theory (GRAPP-09), Lisbon.

    Google Scholar 

  • Samet, H. (1990a). Applications of spatial data structures: Computer graphics, image processing, and GIS. Reading: Addison-Wesley.

    Google Scholar 

  • Samet, H. (1990b). The design and analysis of spatial data structures. Reading: Addison-Wesley.

    Google Scholar 

  • Toussaint, G. (1983). Solving geometric problems with the rotating calipers. In: 2nd IEEE Mediterranean Electrotechnical Conference (MELECON '83), Athens.

    Google Scholar 

  • van den Bergen, G. (1997). Efficient collision detection of complex deformable models using AABB trees. Journal of Graphics Tools, 2(4), 1–14.

    MATH  CrossRef  Google Scholar 

  • van den Bergen, G. (2003). Collision detection in interactive 3D environments. San Francisco: Morgan Kaufmann.

    Google Scholar 

  • Wachter, C., & Keller, A. (2006). Instant ray tracing: The bounding interval hierarchy. In: Eurographics symposium on rendering.

    Google Scholar 

  • Wald, I., & Havran, V. (2006). On building fast kd-trees for ray tracking and on doing that in O(NlogN). In: IEEE symposium on interactive ray tracing.

    Google Scholar 

  • Welzl, E., et al. (1991). Smallest enclosing disks. In H. Maurer (Ed.), New results and new trends in computer science (Lecture notes in computer science, Vol. 555, pp. 359–370). New York: Springer.

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations


Corresponding author

Correspondence to Ramakrishnan Mukundan .

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag London Limited

About this chapter

Cite this chapter

Mukundan, R. (2012). Collision Detection. In: Advanced Methods in Computer Graphics. Springer, London.

Download citation

  • DOI:

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-2339-2

  • Online ISBN: 978-1-4471-2340-8

  • eBook Packages: Computer ScienceComputer Science (R0)