Parallel triangular mesh decimation without sorting

The common task in computer graphics is to visualise models of real world objects. These models are often represented by a triangular mesh, which can be very large and complex (thousands or a million triangles). Since we want a fast and interactive manipulation with the models, we need either to improve our graphics hardware or to find any method for reducing the number of triangles in the mesh. We present a fast algorithm for triangular mesh reduction based on the principle of mesh decimation. We present an efficient and stable algorithm for triangular mesh simplification in a parallel environment. We use a method based on vertex decimation and our original super independent set of vertices to avoid critical sections