Hi,

i want to use a BSP tree for processing boolean operations on solids (CSG).

In theory, i have understood the algorithm, but what actually confuses me is the step when selecting the splitting polygons for the BSP construction process. For example, if i have a cube, do i need a split plane / left and right nodes for each side of the cube?

Any help would be appreciated.

Regards

Gammastrahler