Parallelizing visibility computations on triangulated terrains

This paper addresses the problem of computing visibility information on digital terrain models in parellel, and proposes a parallel algorithm for computing the visible region of an observation point located on the terrain. The algorithm is based on a sequential triangle-sorting visibility approach. Static and dynamic parallelization strategies, both in terms of partitioning criteria and scheduling policies, are discussed. The different parallelization strategies are implemented on an MIMD multicomputer and evaluated through experimental results. -Authors