Jump to content
  • Advertisement


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


BSP Tree for collisions

This topic is 5817 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 will create a BSP Tree for collision detection. The function principe is clear for me, but I haven''t idea about starting to code, because I cannot understand how a tree piloted by a divided box will separate correctly a vertex buffer. The question is how to organize the datas into the tree. I haven''t found any tutorial on the subject. If anywhere has a answers or know any site about that... I work with DirectX8. In advance, thanks for all.

Share this post

Link to post
Share on other sites
you have to have a separate buffer for your bsp tree. you cant use the same vertex information you draw with. that would be super slow, coz you''re probably storing that in video memory

start by having an BSP class that has a copy of all the vertices/triangles. then have node subobjects that have indexes to these vertices/triangles.


Share this post

Link to post
Share on other sites

  • 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!