logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Discrete visibility problems and graph algorithms

delete1997-03-01
delete7
PRE
AI
E
Enrico Puppo *
P
Paola Marzano
DOI：10.1080/136588197242437delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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.
Keywords:
POLYHEDRAL TERRAINS
STEINER PROBLEM
MODELS
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

International Journal of Geographical Information Science cover
International Journal of Geographical Information Science
IF:
5.1
Papers:
2.7K
Citations:
9.3K

Organization

No organization information available