Jump to content
  • Advertisement
Sign in to follow this  
Guru2012

Collision detection algorithm suggestions?

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

The scenario: My particle system includes things like sparks and flames, which should not be allowed to pass through movable objects like boxes and crates. However, particles obviously should be allowed to pass through each other. To implement this, I've subdivided collisions into two types, those between objects, and those between an object and a particle. I am trying to find a collision detection scheme which can handle high density clumped particles (in cases like flames from explosions) and low density movable objects (characters, crates, chairs, hat trees, etc). I'm trying to take advantage of the fact that particles cannot collide with other particles to dramatically reduce the amount of checking done, and I am also trying to take advantage of the sparse distribution of movable objects. Any ideas? I am already using a fixed depth quadtree for detecting terrain collisions, but when I tried doing this collision detection with the quadtree, the amount of bookkeeping required for the ray test slowed the tree down too much. So I'm looking for a secondary data structure.

Share this post


Link to post
Share on other sites
Advertisement
You might try a "hit cache".

Find the poly's from the bounding box of your particle system and then test your ray-hit only with the triangles from the BB.

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.

Participate in the game development conversation and more when you create an account on GameDev.net!

Sign me up!