Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons-Reference-Cited by-同舟云学术

Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons

Published:2020 Issue: Volume: Page:146-157
ISSN:0302-9743
Container-title:WALCOM: Algorithms and Computation
language:
Short-container-title:

Author:

Iwamoto Chuzo^ORCID,Ibusuki Tatsuaki

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-39881-1_13

Reference17 articles.

1. Bärtschi, A., Suri, S.: Conflict-free chromatic art gallery coverage. In: 29th International Symposium on Theoretical Aspects of Computer Science, pp. 160–171 (2012)

2. Çağırıcı, O., Ghosh, S.K., Hliněný, P., Roy, R.: On conflict-free chromatic guarding of simple polygons. arXiv:1904.08624 , 26 pages (2019)

3. Chvátal, V.: A combinatorial theorem in plane geometry. J. Comb. Theory B 18, 39–41 (1975)

4. Eidenbenz, S.J., Stamm, C., Widmayer, P.: Inapproximability results for guarding polygons and terrains. Algorithmica 31, 79–113 (2001)

5. Erickson, L.H., LaValle, S.M.: A chromatic art gallery problem. Technical report, Department of Computer Science, University of Illinois at Urbana-Champaign (2011)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The dispersive art gallery problem;Computational Geometry;2024-02

2. Computational Complexity of the Vertex-to-Point Conflict-Free Chromatic Art Gallery Problem;IEICE Transactions on Information and Systems;2023-09-01

3. Vertex-to-Point Conflict-Free Chromatic Guarding is NP-Hard;WALCOM: Algorithms and Computation;2022

4. NP-completeness of chromatic orthogonal art gallery problem;The Journal of Supercomputing;2020-07-23