Sign in to follow this  

Efficient Intersect Binary Triangle Tree/QuadTree Intersect Mesh Test

Recommended Posts

Hi, I have a terrain build from a quadtree of binary triangle trees. I have an intersect mesh test, but it tests every triangle to make sure than the CLOSEST one is returned. Apart from frustrum culling and backface culling, is there another algorithm that maybe uses some kind of triangle sorting method based on the camera position that would be more efficient? Thanks all

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