On 10/30/07, Alen Ladavac <alenl-ml@croteam.com> wrote:
To ask it straight off... What would be the fastest way to check a ray
against a polygon soup? The mesh is static, so any kind of
precalculation could be ok (as long as the memory requirement is not
ridiculous).

There's also Bounded Interval Hierarchies, the paper looked interesting, though not having fully implemented it I don't want to vouch personally for it :)

http://graphics.uni-ulm.de/BIH.pdf

-charles