Jump to content
  • Advertisement
Sign in to follow this  

Convex hull collision detection with penetration depth

This topic is 4865 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

You might also try the free version of SOLID, which uses GJK to compute static intersection information, and presumably handles arbitrary convex hulls (although I can't say that for sure). Static intersection with penetration depth is fairly easy to code yourself using the separating axis theorem; unfortunately, the SAT doesn't scale well for arbitrary convex polytopes so may not be a viable solution. A Minkowski-based solution such as GJK or the paper nire linked to would probably be preferable.

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.

GameDev.net is your game development community. Create an account for your GameDev Portfolio and participate in the largest developer community in the games industry.

Sign me up!