Browse Library
Sign In Start Free Trial
Close icon Search icon
Account
Browse Library Advanced Search Sign In Start Free Trial

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Game Physics Cookbook
  • Toc
  • feedback
Game Physics Cookbook

Game Physics Cookbook

By : Gabor Szauer
4.3 (4)
close
Game Physics Cookbook

Game Physics Cookbook

4.3 (4)
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 (19 chapters)
close
close
Preface
Preface
What this book covers
What you need for this book
Who this book is for
Sections
Conventions
Reader feedback
Customer support
Free Chapter
1
1. Vectors
1. Vectors
Introduction
Vector definition
Component-wise operations
Dot product
Magnitude
Normalizing
Cross product
Angles
Projection
Reflection
2
2. Matrices
2. Matrices
Introduction
Matrix definition
Transpose
Multiplication
Identity matrix
Determinant of a 2x2 matrix
Matrix of minors
Cofactor
Determinant of a 3x3 matrix
Operations on a 4x4 matrix
Adjugate matrix
Matrix inverse
3
3. Matrix Transformations
3. Matrix Transformations
Introduction
Matrix majors
Translation
Scaling
How rotations work
Rotation matrices
Axis angle rotation
Vector matrix multiplication
Transform matrix
View matrix
Projection matrix
4
4. 2D Primitive Shapes
4. 2D Primitive Shapes
Introduction
2D points
2D lines
Circle
Rectangle
Oriented rectangle
Point containment
Line intersection
5
5. 2D Collisions
5. 2D Collisions
Introduction
Circle to circle
Circle to rectangle
Circle to oriented rectangle
Rectangle to rectangle
Separating Axis Theorem
Rectangle to oriented rectangle
Oriented rectangle to oriented rectangle
6
6. 2D Optimizations
6. 2D Optimizations
Introduction
Containing circle
Containing rectangle
Simple and complex shapes
Quad tree
Broad phase collisions
7
7. 3D Primitive Shapes
7. 3D Primitive Shapes
Introduction
Point
Line segment
Ray
Sphere
Axis Aligned Bounding Box
Oriented Bounding Box
Plane
Triangle
8
8. 3D Point Tests
8. 3D Point Tests
Introduction
Point and sphere
Point and AABB
Point and Oriented Bounding Box
Point and plane
Point and line
Point and ray
9
9. 3D Shape Intersections
9. 3D Shape Intersections
Introduction
Sphere-to-sphere
Sphere-to-AABB
Sphere-to-OBB
Sphere-to-plane
AABB-to-AABB
AABB-to-OBB
AABB-to-plane
OBB-to-OBB
OBB-to-plane
Plane-to-plane
10
10. 3D Line Intersections
chevron up
10. 3D Line Intersections
Introduction
Raycast Sphere
Raycast Axis Aligned Bounding Box
Raycast Oriented Bounding Box
Raycast plane
Linetest Sphere
Linetest Axis Aligned Bounding Box
Linetest Oriented Bounding Box
Linetest Plane
11
11. Triangles and Meshes
11. Triangles and Meshes
Introduction
Point in triangle
Closest point triangle
Triangle to sphere
Triangle to Axis Aligned Bounding Box
Triangle to Oriented Bounding Box
Triangle to plane
Triangle to triangle
Robustness of the Separating Axis Theorem
Raycast Triangle
Linetest Triangle
Mesh object
Mesh optimization
Mesh operations
12
12. Models and Scenes
12. Models and Scenes
Introduction
The Model object
Operations on models
The Scene object
Operations on the scene
The Octree object
Octree contents
Operations on the Octree
Octree scene integration
13
13. Camera and Frustum
13. Camera and Frustum
Introduction
Camera object
Camera controls
Frustum object
Frustum from matrix
Sphere in frustum
Bounding Box in frustum
Octree culling
Picking
14
14. Constraint Solving
14. Constraint Solving
Introduction
Framework introduction
Raycast sphere
Raycast Bounding Box
Raycast plane and triangle
Physics system
Integrating particles
Solving constraints
Verlet Integration
15
15. Manifolds and Impulses
15. Manifolds and Impulses
Introduction
Manifold for spheres
Manifold for boxes
Rigidbody Modifications
Linear Velocity
Linear Impulse
Physics System Update
Angular Velocity
Angular Impulse
16
16. Springs and Joints
16. Springs and Joints
Introduction
Particle Modifications
Springs
Cloth
Physics System Modification
Joints
17
A. Advanced Topics
A. Advanced Topics
Introduction
Generic collisions
Stability improvements
Springs
Open source physics engines
Books
Online resources
Summary
18
Index
Index

Linetest Sphere

Unlike a Raycast, when we perform a linetest we only care about a Boolean result. To check if a Line and Sphere are intersecting, we need to find the closest point to the center of the Sphere on the Line. If the distance between the closest point and the center of the Sphere is less than the radius of the Sphere, the shapes intersect:

Getting ready

We are going to implement a function to check if a Line and a Sphere intersect. This function will return a Boolean result. We will avoid the square root involved in finding the distance between the two points by checking the squared distance.

How to do it…

Follow these steps to implement line testing against a sphere:

  1. Declare the Linetest function in Geometry3D.h:

    bool Linetest(const Sphere& sphere, const Line& line);

  2. Implement the Linetest function in Geometry3D.h:

    bool Linetest(const Sphere& sphere, const Line& line) {
   Point closest = ClosestPoint(line, sphere.position);
   float distSq = MagnitudeSq(sphere.position...
End of Section 5
Next Section
bookmark search playlist download
font-size

Change the font size

margin-width

Change margin width

day-mode

Change background colour

Close icon Search
Country selected
Close icon Your notes and bookmarks

Delete Bookmark

Modal Close icon
Are you sure you want to delete it?
Cancel
Yes, Delete