Research on tessellation with triangle strip

The tessellation module of graphics pipeline can generate many triangles to specify surface detail characteristics, which are usually organized in triangle lists. However, the number of generated vertices is large and there are many repeated vertices. This paper proposes a new tessellation approach of triangle strips, which makes use of the adjacent relationship among triangles. It decreases the number of generated vertices which will benefits latter computation and storage. Experiments show that the number of generated vertices by the strip approach is about 51% of traditional triangle lists, which can improve the performance of GPU tessellation.