Jump to content
  • Advertisement
Sign in to follow this  

Collision Detection - old thread reopened

This topic is 3077 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'd like to continue the discussion started at

old thread

particularly to answer to Kwizatz, which I forgot to do months ago :/


So, about collisions in Q3 (or Id's MAP files) you're telling this procedure:
- move all the planes of the brush in the direction of they normal with displacement = sphere_radius
- now you obtain a new "enlarged" brush, ready for a point-plane intersection
- perform the test on all those planes (obviously checking if the point is inside the plane..)
- in case, perform sliding

But that arises some questions:
- brushes are collections of planes. How do you rapidly identify which planes to ignore ?
- in the moment you have just the translated planes equations, you have to perform plane-plane intersection again to find out the vertexes, used to find out if the point is inside the face/faces. This sounds slow, isn't it ?

I'm my engine I can read MAP files, but don't have any BSP. I just use an octree to store the data about the meshes.


About handling stairs and small objects, I will try your algorithm ;)

Thanks also for the link about MDK2 collision detection.

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.

GameDev.net is your game development community. Create an account for your GameDev Portfolio and participate in the largest developer community in the games industry.

Sign me up!