Jump to content
  • Advertisement
Sign in to follow this  
Mr.L

My SAT 3D Algorithm

This topic is 2269 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 made a SAT 3D Algorithm for two thetraedron, which works like this:



[font=comic sans ms,cursive][font=courier new,courier,monospace]i made this for each polyhedron.

I made the face normals with the cross product of two edges, like this:
getcross((PointB-PointA)),(PointC-PointA));
for each face, to get the normal.
then i searched the biggest and smallest Projection value.
then I compered them for overlap.[/font][/font]



[font=arial,helvetica,sans-serif]the Problem is:[/font]

[font=arial,helvetica,sans-serif]If theres a collision, it alwys returns true, but it also returns true if theres no collision sometimes.[/font]


[font=arial,helvetica,sans-serif]Did i forget something?[/font]

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!