Skip to main content

Discrete visibility problems and graph algorithms

Buy Article:

$59.35 plus tax (Refund Policy)

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.

Document Type: Research Article

DOI: http://dx.doi.org/10.1080/136588197242437

Publication date: March 1, 1997

More about this publication?
tandf/tgis/1997/00000011/00000002/art00002
dcterms_title,dcterms_description,pub_keyword
6
5
20
40
5

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more