>> I wonder if any BST self-balancing algorithms are applicable to BSP?
> 
>   AFAIK, no.
> 
>   "Balancing a kd-tree requires care. Because kd-trees are sorted in
> multiple dimensions, the tree rotation technique cannot be used to
> balance them - this may break the invariant."

Hmm. Yes, I can see how that would be a problem. Pity...

-- 
http://blog.orphi.me.uk/
http://www.zazzle.com/MathematicalOrchid*

Post a reply to this message