Discrete visibility problems and graph algorithms

Author: Puppo Enrico   Marzano Paola  

Publisher: Taylor & Francis Ltd

ISSN: 1365-8824

Source: International Journal of Geographical Information Science, Vol.11, Iss.2, 1997-03, pp. : 139-161

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Abstract. Many problems of practical interest involve line-of-sight on a topographic surface. Some such problems can be successfully studied on the basis of the mutual visibility among a finite number of representative points. Such visibility problems can be formalized and resolved as graph problems. In this paper, we show that graph algorithms can be useful to find efficient solutions for discrete visibility problems in several cases. On the basis of results from the theory of complexity, we give some practical rules to apply such an approach. We further investigate the solution of some relevant visibility problems under this perspective.