Triangle surface models belong to the most popular type of geometric objects description in computer graphics. Therefore, the problem of fast visualization of this type of data is often solved. One of popular approaches is stripification, i.e., a conversion of triangle surface into strips of triangles. This enables to reduce the rendering time by reduction data size and by avoiding of redundant lighting and transformations computations.

In this paper we present a new stripification algorithm for static fully triangulated meshes. Our new algorithm is based on the dual graph of triangulation. The experimental results show that our stripification produces much lower number of triangle strips than other stripification algorithms (except one).