Book Image

Game Physics Cookbook

By : Gabor Szauer
Book Image

Game Physics Cookbook

By: Gabor Szauer

Overview of this book

Physics is really important for game programmers who want to add realism and functionality to their games. Collision detection in particular is a problem that affects all game developers, regardless of the platform, engine, or toolkit they use. This book will teach you the concepts and formulas behind collision detection. You will also be taught how to build a simple physics engine, where Rigid Body physics is the main focus, and learn about intersection algorithms for primitive shapes. You’ll begin by building a strong foundation in mathematics that will be used throughout the book. We’ll guide you through implementing 2D and 3D primitives and show you how to perform effective collision tests for them. We then pivot to one of the harder areas of game development—collision detection and resolution. Further on, you will learn what a Physics engine is, how to set up a game window, and how to implement rendering. We’ll explore advanced physics topics such as constraint solving. You’ll also find out how to implement a rudimentary physics engine, which you can use to build an Angry Birds type of game or a more advanced game. By the end of the book, you will have implemented all primitive and some advanced collision tests, and you will be able to read on geometry and linear Algebra formulas to take forward to your own games!
Table of Contents (27 chapters)
Game Physics Cookbook
About the Author
About the Reviewer
Customer Feedback

Oriented rectangle to oriented rectangle

There are two ways we can check for collision between two oriented rectangles. First, we could extend the SAT test with two additional axis. This means we would have six axes of potential separation:

  • The X and Y axis of the world

  • The local X and Y axis of the first rectangle

  • The local X and Y axis of the second rectangle.

While adding two new axes of potential separation would not increase the cost of the collision check too much, there is an alternate, somewhat easier way we can perform an intersection test between two oriented rectangles.

The other way to check intersection would be to translate both rectangles into the local space of the first rectangle, leaving us with a non-oriented rectangle and an oriented rectangle. At that point we could just call our existing function from the last section. We're going to use the latter method, where we translate one rectangle into the local space of the other one.

Getting ready

We are going to implement a function...