Visibility optimization using variational approaches (Q2493367): Difference between revisions

Regions visible to a given observer are determined when obstacles to sight are present. Algorithms to maximize the volume of the visible regions in a compact subset of the space are presented. Three different problems are investigated: The optimal location for one observer, the optimal location for a collection of observers and the optimal path of an observer travelling from a position A to a position B. Two basic strategies are considered. In one strategy level set functions defined earlier are used for the determination of local maxima. The second strategy involves the construction of an energy whose minimum achieves the desired effect. Different extensions of the visibility optimization problem are presented and illustrated by examples.