Re: [Algorithms] vipm instancing

[Charles B. <cb...@cb...>]

At 10:57 AM 8/4/2000 +0100, you wrote:
>I thought of maybe using some kind of linked triangle list with the extra
>tris being paged in, stuck in a different chunk of ram then linked to the
>last chunk. Bad fragmentation and cache trouble I fear, though...

Why do you say that?  You could have a chunk of ram, say 2 MB, which you
reserve for all your VIPM index lists.  Then you could write your own,
simple memory manager for the VIPM index lists.  You actually wouldn't need
linked lists, you could implement a "pushing" manager where you moved other
lists around to make room for you to just grow your list linearly.

I think this use of instanced VIPM, along with compressed VB's like I
describe on my web page, and the optimized prefixes that Tom has just
recently mentioned, can combine to be the golden ratio of the year,
as it were.  Using all that, you could really push 10 MTris/frame of
real useful geometry on X-Box, for example.

--------------------------------------
Charles Bloom           www.cbloom.com