Skip to main content

Collision Detection

  • Chapter
  • First Online:
Advanced Methods in Computer Graphics

Overview

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 84.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • 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.

    Article  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.

    Article  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.

    Book  Google Scholar 

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

    Book  MATH  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.

    Article  MATH  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.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

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. https://doi.org/10.1007/978-1-4471-2340-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-2340-8_9

  • 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)

Publish with us

Policies and ethics