Algorithms for visibility computation on digital terrain models


In the paper, we consicler the problem of computing visibility information on cligit al terrain models. Visibility problems on polyhedral terrains are classified according to the kind of visibility information computed into point visibility, line visibility and region visibility. A survey of the stateof-the-art of the algorithlns for computing visibility is presented, according to the chssification introduced.

Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice