RE: [Algorithms] BSP tree without splits

[Gribb, G. <gg...@ra...>]

> > I've written a ray tracer that worked with a BSP 
> constructed in this way.
> > I'm guessing your collision detection queries are similar 
> in nature to the
> > operation of a ray tracer, no?
> 
> If this is the case, wouldn't a BV-tree be just as good or 
> better than a BSP
> tree ? It does not split faces in the first place, and by 
> nature provides
> the same kind of logarithmic speed.

Many (or most) game programmers don't know how to do collision against
polygon soup. But I agree, if you are using a bsp tree "for collision only",
you shouldn't be using a bsp tree at all.

-Gil