Leaf Last edited 3 months ago2023-12-18 10:03:53 UTC

A leaf is the end node of any hierarchical tree data structure*. In the context of BSP trees, it's the end node that describes a portion of the level geometry after the BSP partitioning stage is done.

Properties associated with each BSP leaf include: When two leafs connect there is a portal, and VIS does calculations for the PVS by doing algorithms against the area of the portal. The portal file is generated separately by the BSP compiler and not included in the final BSP file.

Associated Goldsource Error: leaf portals saw into leaf

* It follows the analogy of real life trees, which has a root, branches, and leaves at the end.
The previous content needs reviewing before removal. It's kept below:
A triangular area/wedge of the map used by VIS to determine line of sight through portals to other leafs, so that the engine will know what wpolys to draw on screen. this relates to r_speed because if you can see from one leaf/portal into others, then all the wpolys are drawn and the r_speed is affected.

1 Comment

Commented 10 years ago2013-05-30 17:45:04 UTC Comment #101175
Where there are leaves, there are trees!

You must log in to post a comment. You can login or register a new account.