Sign in to follow this  

BSP trees

Recommended Posts

I am trying to understand bsp trees, I think I have it, I just want to make sure. In 2d, you would take a line and fin the normal and divde by left or right, recursivly for all lines right, building a tree. But for the viwer, would you test each frutsum line in the tree to seee what lines were to the inside of the frutsum? So you would traverse the tree twice per line in the frutsum?

Share this post

Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

Sign in to follow this