O'Reilly logo

Core Techniques and Algorithms in Game Programming by Daniel Sánchez-Crespo Dalmau

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Chapter 22. Geometrical Algorithms

 

“Don't try to be like Jackie. There is only one Jackie.… Study computers instead.”

 
 --Jackie Chan

KEY TOPICS

  • Point Inclusion Tests

  • Ray Intersection Tests

  • Moving Tests

  • Point Versus Triangle Set Collision (BSP-Based)

  • Mesh Versus Mesh (Sweep and Prune Approach)

  • Computing a Convex Hull

  • Triangle Reduction

  • In Closing

This chapter is devoted to providing you with a collection of useful geometrical tests for computer games. Most of it deals with the subject of collision detection and response, which is of extreme importance for almost any game. However, there are many more techniques to explore. We need to detect the room the player is standing in, compute the sound propagation, and explore a myriad of other tests we will end ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required