What’s the basic difference between what a BSP tree does and what OGL’s default depth sorting does? Right now I can give OGL a bunch of polys and it can render them all in the correct order of depth and the image looks fine.
I noticed the rendering is much slower than say, the Quake3 engine. I hear a BSP tree would speed this up, so is a BSP tree more than just a way to sort polygons?
Thanks.