Collision detection I: The Gilbert-Johnson-Keerthi Algorithm

2022-11-26

It's fair to say that collision detection and resolution is arguably the most important part of any physics library. A good collision system can make or break any library or game. Several algorithms exist for it with GJK being one of the most popular ones. The collision detection system in my library has 3 steps to build a full manifold, with the first step being GJK.

Collision detection II: Expanding Polytope Algorithm

2023-03-20

In the second step of collision detection, we will look at an algorithm that gives us the contact normal and penetration depth.

Collision detection III: Contact Points

2023-04-02

In the last part of the collision detection series we're taking a look at how to generate contact points for spheres, boxes and convex hulls

Spring-mass systems

2023-06-23

In physics programming, springs hold big significance as they offer a fundamental model for simulating dynamic systems and interactions. In this article we’ll take a look at what springs are at their very core.