Optimal art gallery localization is NP-hard
From MaRDI portal
Publication:2306359
DOI10.1016/j.comgeo.2020.101607zbMath1442.68249arXiv1706.08016OpenAlexW3001381102WikidataQ126304036 ScholiaQ126304036MaRDI QIDQ2306359
Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel H. M. Smid
Publication date: 23 March 2020
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.08016
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational aspects of satisfiability (68R07)
Cites Work
This page was built for publication: Optimal art gallery localization is NP-hard