RE: [Algorithms] VIPM With T&L - what about roam

[Tony C. <to...@mi...>]

>In practice the extra bandwidth of the indices is pretty tiny. One DWORD
per
>tri? Peanuts, considering your average fairly efficiant vertex-caching
>scheme will need to load a whole vertex (around 32 DWORDS) per tri.

You mean 32 BYTEs not DWORDs, right Tom? Still much bigger than the index
data though. Your other comments about lists versus strips for VIPM seem
right on the money.

Tony Cox - DirectX Luminary
Windows Gaming Developer Relations Group
http://msdn.microsoft.com/directx