72 citations · 98 across the 9 of their papers we have counts for
1 paper · 1 filter
Yangdi Lyu, Alper Üngör
Terrain Guarding Problem(TGP), which is known to be NP-complete, asks to find a smallest set of guard locations on a terrain T such that every point on T is visible by a guard.…