Jump to content
  • Advertisement
Sign in to follow this  
Walkerism

Minkowski Difference

This topic is 2546 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

Hi everyone,

Currently I'm implementing rotations and more complex objects into my 2d program. As a result I need to alter my collision detection. I've chosen to incorporate the Minkowski Difference, which so far is proving to be troublesome simply because I can't find a decent resource or tutorial that explains in steps the process behind calculating a collision using the sum.

I know how to apply the equation X ? Y = {A + B: A ? X and B ? Y} , but I can't work out how to apply this in my program to detect two objects colliding.

My question is this. What steps would I need to take to find the collision between say, two squares; each square with four vertices's for each corner, and an origin in world space.

Any advice would be fantastic!

luke.

Share this post


Link to post
Share on other sites
Advertisement
What you're looking for is the GJK algorithm for collision detection, which uses the concept of the Minkowski Difference for fast collision detection. Google that and you should find more relevant stuff. I myself found this video very helpful for understanding how GJK works: https://mollyrocket.com/849

Share this post


Link to post
Share on other sites
Sign in to follow this  

  • Advertisement
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

We are the game development community.

Whether you are an indie, hobbyist, AAA developer, or just trying to learn, GameDev.net is the place for you to learn, share, and connect with the games industry. Learn more About Us or sign up!

Sign me up!