Triangular Mesh Decimation in Parallel Environment

Abstract

The aim of the computer graphics is to visualise models of real-world objects. The visualization of large and complex models is required more and more often frequently. This is followed by number of operations which must be done before own visualization, whether it be an analysis of input data (e.g. searching for an isosurface) or a model simplification. In spite of huge progress made in graphics hardware field in last years, we still need to increase a performance using optional algorithms and programming techniques. One of the techniques that enhance the power in parallel computation. It can be seen that multiprocessor computers are more often available even for ordinary users. Together with Microsoft Windows expansion we have easy and comfortable tools for multiprocessor (multithread) programming as well. We present an original efficient and stable algorithm for triangle mesh simplification in parallel environment. We use a method based on our original super independent set of vehicles to avoid critical sections. Programs have been verified on MS Windows platform using standard Borland Delphi classes for multithread programming.