Archived

This topic is now archived and is closed to further replies.

static geometry collision detection structures

This topic is 5670 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 recently approached the issue of collision detection of objects with the static world. Relying on papers and ideas in the latest game programming gems book, I build a compressed AABB tree of the world triangles. A node and a leaf of this tree just takes 8 bytes, and the O(logn) behaviour makes the search fast. So I end up with finding possible collision triangles quite fast, but now for this potential set of colliding AABB triangles I must do some line-intersect-triangle tests which seem expensive to me. I''d like to ask if you found a better data representation for the collision database: instead of putting just the the triangle extents (AABB) in it, an approach that takes slightly more memory but reduces runtime checks would be nice. - thomas

Share this post


Link to post
Share on other sites