I was wondering if anyone has tried using concave objects as the leaves of a binary tree. I was reading about it as a way to enhance a bsp trees performance, but for as few faces that flash generally handles, I wondered if this method would be worthwhile to implement, or if it would be more suitable to remain with a plane of the world per node.

If it is very worthwhile, can anyone point me in the right direction with these topics:

-determining a suitable plane to use as a partition (easy with just using the faces of the world...a bit more a pain when using "abstract faces")

-some idea how to handle concave objects

-what to do when convex objects intersect, or concave and convex objects intersect

I have a general faint idea where to go with these topics, but it'd be nice to hear someone else's input.