Name
Abstract | ||
|---|---|---|
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 by De Floriani et al. (1989). 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. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1080/02693799408902019 | INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SYSTEMS |
Keywords | Field | DocType |
visibility,triangulated irregular networks,parallel computing,digital terrain modeling,data parallelism.,parallel computer,point location,triangulated irregular network,digital terrain model,parallel algorithm | Visibility,Scheduling (computing),Computer science,Parallel algorithm,Terrain,Parallel computing,Triangulation,MIMD,Computation | Journal |
Volume | Issue | ISSN |
8 | 6 | 0269-3798 |
Citations | PageRank | References |
10 | 0.88 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Leila De Floriani | 1 | 1382 | 202.03 |
| Claudio Montani | 2 | 1595 | 135.33 |
| Roberto Scopigno | 3 | 3056 | 236.09 |