Linear-Speed Vertex Cache OptimisationTom Forsyth, RAD Game Tools: tom.forsyth@eelpi.gotdns.org 28th September 2006 Introduction This paper introduces an algorithm for optimising an indexed triangle list to be friendly to a wide variety of hardware vertex caches of unknown size. The method has the advantage of being universally good for a wide range of cache sizes and replacement policies, of running in linear (and fast) time and spac
