Monotone Paths with Visibility Properties

This paper deals with the visibility properties of monotone paths connecting two points in the presence of polygonal obstacles. We examine the development of efficient algorithms for constructing a monotone watchman path from which any point on the boundary of obstacles is visible from some point along the path. Specifically, we formulate visibility aware monotone watchman path (VAMWM) problem and present a heuristic approach for solving it.