BSP tree

Started by
2 comments, last by ludo8x 20 years ago
Hello everyone, i have some problem with BSP trees! What''s the main difference between node based BSP tree and leafy based BSP tree ? What are advantage/drawback of this two methods ?? Besides, without portal rendering with BSP trees always all the polygons of the scene are rendered ???
Advertisement
"Besides, without portal rendering with BSP trees always all the polygons of the scene are rendered"

No they are not.
I don''t know the answer to your first question.
Why do my programs never work on other computers?
In a solid leaf BSP tree, all polys are splitters, and the front list contains all polys classified to be in front of the splitter´s plane, as well as the splitting plane itself. the back list is always NULL.
Ow!

Are you sure there?



From what I''ve read, a node-based BSP tree stores all the polygons in the nodes, as splitters.

A leaf-based BSP tree stores the polygons in the leafs, as convex sets.


Leaf-based BSPs are more useful in my opinion.



No portal rendering....all polys......

No. Definitely not.
Quake/Q2/Half-Life etc use a thing called a PVS (potentially visible set) to specify which nodes are visible from a particluar node.

(That''s what the costly Vis process is about)
die or be died...i think

This topic is closed to new replies.

Advertisement