Mathematical logic quarterly · 1995 · 106 citations · 1 references
Natural SciencesMathematicsCombinatoricsComputational GeometryGeometryGeometric OptimizationCovering Problems
Abstract D. T. Lee and A. K. Lin [2] proved that VERTEX‐GUARDING and POINT‐GUARDING are NP‐hard for simple polygons. We prove that those problems are NP‐hard for ortho‐polygons, too.
1
Computational complexity of art gallery problems
D. Lee, A. Lin · IEEE Transactions on Information Theory · 1986 · 406 citations