Parallelizing Visibility Computations on Triangulated Terrains

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.

[1]  Ady Wiernik,et al.  Planar realizations of nonlinear davenport-schinzel sequences by segments , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[2]  Micha Sharir,et al.  Efficient hidden surface removal for objects with small union size , 1991, SCG '91.

[3]  Leonidas J. Guibas,et al.  The upper envelope of piecewise linear functions: Algorithms and applications , 2015, Discret. Comput. Geom..

[4]  Leslie G. Valiant,et al.  General Purpose Parallel Architectures , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[5]  Jeffrey Scott Vitter,et al.  A Simplified Technique for Hidden-Line Elimination in Terrains , 1992, STACS.

[6]  Theoharis Theoharis.  Algorithms for Parallel Polygon Rendering , 1989, Lecture Notes in Computer Science.

[7]  Mohan S. Kankanhalli,et al.  Parallel object-space hidden surface removal , 1990, SIGGRAPH.

[8]  Geoffrey C. Fox,et al.  Implementing an intervisibility analysis model on a parallel computing system , 1992 .

[9]  Nicholas Carriero,et al.  How to write parallel programs: a guide to the perplexed , 1989, CSUR.

[10]  John H. Reif,et al.  An efficient output-sensitive hidden surface removal algorithm and its parallelization , 1988, SCG '88.

[11]  M. Goodchild,et al.  Coverage problems and visibility regions on topographic surfaces , 1990 .

[12]  C. Lawson.  Software for C1 Surface Interpolation , 1977 .

[13]  International symposium on spatial data handling , 1984 .

[14]  Jay Lee.  Analyses of visibility sites on topographic surfaces , 1991, Int. J. Geogr. Inf. Sci..

[15]  Leila De Floriani,et al.  Proceedings of the 8th International Conference on Image Analysis and Processing , 1995 .

[16]  Roberto Scopigno,et al.  Parallel depth-merge: A paradigm for hidden surface removal , 1993, Comput. Graph..

[17]  Al Geist,et al.  Network-based concurrent computing on the PVM system , 1992, Concurr. Pract. Exp..

[18]  Mark de Berg,et al.  Efficient ray shooting and hidden surface removal , 1991, SCG '91.

[19]  G. C. Fox,et al.  Solving Problems on Concurrent Processors , 1988 .

[20]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[21]  Richard Cole,et al.  Visibility Problems for Polyhedral Terrains , 2018, J. Symb. Comput..