[mrshoe]

I finally committed a stable implementation of a BSP Tree for Sol. I figured this is as good a time as any to start a new forum thread.

I plan on spending a good amount of time optimizing the BSP Tree. The first things to be optimized are:

*Memory footprint of BSP Nodes
*Deciding when to split a node and when to not split
*Finding an optimal splitting location and axis for a node

Some ideas to try include McDonald and Booth's cost function and this variation on it.

I also plan on tweaking the McDonald and Booth heuristic a bit based on deficiencies I see in some of the assumptions their work is based on.

In addition, I have a few ideas of my own that I would like to experiment with. I will post the results of all experiments here.