Journal Article

Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons

Mathematical Logic Quarterly (1995) 41(2) 261-267
DOI: 10.1002/malq.19950410212
96Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. Copyright © 1995 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim

Author supplied keywords

Cite

CITATION STYLE

APA

Schuchardt, D., & Hecker, H. ‐D. (1995). Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons. Mathematical Logic Quarterly, 41(2), 261–267. https://doi.org/10.1002/malq.19950410212

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free