Re: [Algorithms] BSP tree, or what?

[Eric H. <eri...@gm...>]

I like the idea of rebuilding in parallel over N frames, but how does that
really work? If stuff is moving, do you sort of make a copy of the boxes'
current locations and build off of that, or...?

Also, how do you form your trees quickly and so they're efficient? I'm
finding simple median splits stink.

Eric


On Wed, Jun 4, 2008 at 9:47 AM, Pierre Terdiman <pie...@gr...>
wrote:

> > 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.
>
>
> -------------------------------------------------------------------------
> Check out the new SourceForge.net Marketplace.
> It's the best place to buy or sell services for
> just about anything Open Source.
> http://sourceforge.net/services/buy/index.php
> _______________________________________________
> GDAlgorithms-list mailing list
> GDA...@li...
> https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
> Archives:
> http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list
>