Two NP-hard art-gallery problems for ortho-polygons. (English) Zbl 0827.68115
Summary: D. T. Lee and A. K. Lin (1986) proved the VERTEX-GUARDING and POINT- GUARDING are NP-hard for simple polygons. We prove that those problems are NP-hard for ortho-polygons, too.
MSC:
| 68U05 | Computer graphics; computational geometry (digital and algorithmic aspects) |
| 68Q25 | Analysis of algorithms and problem complexity |
| 68Q15 | Complexity classes (hierarchies, relations among complexity classes, etc.) |
References:
| [1] | and , Computers and Intractability. Freeman, San Francisco 1979. |
| [2] | and , Computational complexity of art-gallery problems. IEEE Trans. Information Theory, IT-32, No.2 (1986). · Zbl 0593.68035 |
| [3] | Art Gallery Theorems and Algorithms. Oxford University Press, New York-Oxford, 1987. · Zbl 0653.52001 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
