A pvs contains a bit for every leaf ( convex clump of polygons ) in the bsp tree - if that leaf is potentially visible from the current leaf the bit was set.

• PVS含有每一个叶子节点是否可见的信息，如果那个叶子从当前叶子是可见的，那么PVS中相对应的那一个bit被置位。