Cache-Friendly Triangle Strip Generation Based on Hybrid Model

Most of the existing cache optimization triangle generation methods have a critical problem that high cache optimization and wide applicability cannot be achieved at the same time.To solve this problem,a new algorithm that employs hybrid model to generate triangle strips is proposed in this paper.Measured by optimal cost function,given a mesh,a sequence of triangle strips which have the minimal vertex cache miss rate is generated by this algorithm.It adopts last-in-first-used(LIFU)vertices cache replacement policy.Moreover,it redefines a novel primary cost function.Measured by the cost function,the triangle strip can grow in either counter-clockwise or clockwise direction,which is beneficial to the vertices re-use among one triangle strip and further ensures low cache miss rate even in any oblivious cache.Examples show both high cache optimization and wide applicability can be achieved at the same time.It can be an effective solution to the bus traffic between graphics subsystem and memory.