Jump to content
  • Advertisement
Sign in to follow this  
savedbygamesandcodes

The Fastest Collision Detection Arithmetic between 2D Polygons Available?

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

I found this article(Efficient Collision Detection between 2D Polygons): http://wscg.zcu.cz/wscg2004/Papers_2004_Full/B83.pdf Is it the fastest collision detection arithmetic between 2D polygons? And is there any portable source code/lib implement the fastest arithmetic available? [Edited by - savedbygamesandcodes on June 13, 2006 7:10:38 AM]

Share this post


Link to post
Share on other sites
Advertisement
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!