Variants of Visibility and their Complexity
Dietmar Schuchardt, Hans‐Dietrich Hecker · Mathematical logic quarterly · 1998
Abstract First we give an overview about variants of visibility and related problems. Then we prove that some guarding and covering problems are NP‐hard for ortho‐polygons with holes, using a so‐called vertex cover technique.