Technical Reports

The ICICS/CS Reading Room

UBC CS TR-2000-02 Summary

R-Simp to PR-Simp: Parallelizing A Model Simplification Algorithm, February 07, 2000 Dmitry Brodsky, 8 pages

As modelling and visualization applications proliferate, there arises a need to simplify large polygonal models at interactive rates. Unfortunately existing polygon mesh simplification algorithms are not well suited for this task because they are either too slow (requiring pre-computation) or produce models that are too poor in quality. Given a multi-processor environment a common approach for obtaining the required performance is to parallelize the algorithm. Many non-trivial issues need to be taken into account when parallelizing a sequential algorithm. We present PR-Simp a parallel model simplification algorithm and the issues involved in parallelizing R-Simp.

If you have any questions or comments regarding this page please send mail to