Comparative Analysis of Triangle Stripification Methods

Triangle Surface models are nowadays most often types of geometric objects description in computer graphics. For visualization of triangular models, geometry and topological information is sent to the pipeline. This information contains three coordinates, and optional normal, color and texture information. Therefore, the problem of fast visualization of this type of data is often solved. One of popular approaches is stripification. Stripification helps to reduce the rendering time by reduction of data size and avoid to redundant lighting and transformation computations. Stripification is a process of trying to rearrange polygonal data in such a way the adjacent polygons could be represented as triangle strips instead of their more complex form, thus saving vertices. This paper describes the algorithms for stripification and gives the performance analysis of these algorithms.