Re: [Algorithms] BSP tree, or what?

[Pierre T. <pie...@gr...>]

> Anyway, I'm interested in anyone's practical experiences here. As usual,
> I suspect it's a case of "it all depends", but I'd love to know what
> people have found useful and useless.

I use AABB trees for everything. A static AABB-tree for static stuff, a 
dynamic AABB-tree for dynamic stuff (*).

Simple, versatile, fast, to-the-point.

- Pierre

(*) double-buffered, one gets "refit" for N frames while another one gets 
rebuilt in parallel over N frames. After N frames, switch them and start 
again.