• Advertisement
Sign in to follow this  

collision detection - arbitrarily irregular "concave" objects

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

[font="Book Antiqua"]I'm trying to determine what narrow-phase collision detection techniques are fastest to execute for arbitrarily irregular "concave" objects. Most importantly, I'd like to know approximately how much slower they are than convex hull techniques like GJK (on the convex hull of the same objects). The emphasis I see on convex hull techniques implies that every technique that works reliably on arbitrarily irregular "convex" objects is slower than GJK. The question is, how much slower?

Mine is 2x to 20x slower than my GJK implementation. While 2x slower is not a big problem, 20x slower "hurts". I'm pretty sure I see a way to reduce the upper end to 10x ~ 15x slower, but not further. Hence my desire to see whether faster approaches exist. Thanks in advance for any ideas or tips.[/font]

Share this post

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

  • Advertisement