[SamPlay]

hello,
build a map from the bsptree:
- start with an aabox ( a convex poyhedron) big enough to encompass the virtual world
- split this aabox by the bsptree down to leaves ( which carry contents information);
in cases where a node plane splits the current polyhedron, build 2 faces to close the two resulting polyhedra on the splitting plane.
you will get all the faces ( associated with contents of the leaf they bound)/edges/vertices you need