Efficient generation of triangle strips from triangulated meshes

Abstract

This paper presents a fast algorithm for generating triangle strips from triangulated meshes, providing a compact representation suitable for transmission and rendering of the models. A data structure that allows efficient triangle strip generation is also described. The method is based on simple heuristics, significantly reducing the number of vertices used to describe the triangulated models. We demonstrate the effectiveness and speed of our method comparing it against the best available program.