Coverage problems and visibility regions on topographic surfaces

The viewshed of a point on an irregular topographic surface is defined as the area visible from the point. The area visible from a set of points is the union of their viewsheds. The authors consider the problems of locating the minimum number of viewpoints to see the entire surface, and of locating a fixed numer of viewpoints to maximize the area visible, and possible extensions. They discuss alternative methods of representing the surface in digital form, and adopt a TIN or triangulated irregular network as the most suitable data structure. The space is tesselated into a network of irregular triangles whose vertices have known elevations and whose edges join vertices which are Thiessen neighbours, and the surface is represented in each one by a plane. Visibility is approximated as a property of each triangle: a triangle is defined as visible from a point if all of its edges are fully visible. The authors present algorithms for determination of visibility, and thus reduce the problems to variants of the location set covering and maximal set covering problems. They examine the performance of a variety of heuristics.