Abstract

This thesis examines two largely unrelated problems in applied algorithmics, motivated by the search for efficient geometric algorithms. In the first part of the thesis, we consider the problem of finding efficient parallel algorithms for heterogeneous parallel computers, i.e., parallel computers in which different processors have different computational potential. To this end, we define a formal computational model for heterogeneous systems and develop algorithms for commonly used communication operations. The result is that many existing parallel algorithms which use these communication operations can be adapted to our model with little or no modifications. In the second part of the thesis we consider the problem of geometric models which allow for varying levels of detail. To this end, we extend the progressive mesh representation introduced by Hoppe. The main technical contribution of this part is an efficient scheme for refining only selected regions of a progressive mesh. Using ...

Citations