## Abstract

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. We consider the problems of locating the minimum number of viewpoints to see the entire surface, and of locating a fixed number of viewpoints to maximize the area visible, and possible extensions. We 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. We present algorithms for determination of visibility, and thus reduce the problems to variants of the location set covering and maximal set covering problems. We examine the performance of a variety of heuristics.

Original language | English (US) |
---|---|

Pages (from-to) | 175-186 |

Number of pages | 12 |

Journal | Annals of Operations Research |

Volume | 18 |

Issue number | 1 |

DOIs | |

State | Published - Dec 1 1989 |

Externally published | Yes |

## ASJC Scopus subject areas

- Decision Sciences(all)
- Management Science and Operations Research