It’s been a while and to be honest I haven’t completed much (as far as implementation). However, the current version of the project is now 0.7.2 so at least you can see we are getting closer to release. The latest version contains a number of improvements and two joints. The testbed received a little face lift and the tests have been tweeked for consistency.
Posted on May 31, 2010
In the last few posts we learned about using GJK for collision detection, distance between shapes, and finding the closest points. It was stated that GJK must be augmented with another algorithm to find collision information like the penetration depth and vector. One such algorithm is EPA.
Posted on May 14, 2010
The last installment talked about the GJK algorithm as it pertains to collision detection. The original algorithm actually is used to obtain the distance and closest points between two convex shapes.
Posted on April 26, 2010
Today I’m going to talk about the other collision detection algorithm packaged with the dyn4j project. You can find a lot of GJK documentation but much of it is really technical mostly because they are research papers. I strongly recommend this video tutorial and to be honest you may not even need to read any further after watching. But if you feel you need more information after watching the video please read on.
Posted on April 13, 2010
This is a post I have been meaning to do for some time now but just never got around to it. Let me first start off by saying that there are a ton of resources on the web about this particular collision detection algorithm. The problem I had with the available resources is that they are often vague when explaining some of the implementation details (probably for our benefit).
Posted on January 01, 2010