Istituto di Scienza e Tecnologie dell'Informazione     
De Floriani L., Montani C., Scopigno R. Parallelizing visibility computations on triangulated terrains. Internal note CNUCE-B4-93-013, 1993.
In this paper we address the problem of computing visibility information on digital terrain models in parallel. We propose 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 proposed in [4]. 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
Subject triangulated terrains
parallelization strategies

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional