Original Post
I have been working with BSP''s for a little bit and I have been reading up on some other types of sorting. I was looking at Octree''s and it seems like a very good idea to me based on the information I have read.
I also noted that almost all of the tutorials and articles that I have read say that they don''t provide depth sorting and that you will either have to rely on your own method or use the built in capability of the API you are using (OpenGL, Direct3D). I was wondering if it would be feasible to use a BSP in each of the nodes of the octree. Say there was a limit of minimum of 10 poly''s in each node of the octree. Would it be feasible to use a BSP for each set of 10 poly''s or would this just create more havoc for the computer to deal with than it would be to use some other method.
If anyone has any demo''s or anything about octree''s or BSP''s I would love to see them and you can e-mail them to me here. Also, if you have ever combined these two things that would also be appreciated.
Thanks
Shawn