Re: [Algorithms] BSP tree, or what?
Brought to you by:
vexxed72
|
From: Stefan S. <kef...@gm...> - 2008-06-04 15:20:36
|
Perhaps a good idea to look into bih & bvh trees as well, as they build much quicker than kd's.. Aras Pranckevicius wrote: >> I should have been clearer: yes, I'm using the GPU. By BSP trees I mean >> axis-aligned hierarchical trees, not the polygon-plane-aligned >> old-school Doom stuff. >> > > So it's a kd-tree then? > > > > |