Computational complexity of the chromatic art gallery problem for orthogonal polygons

DOI10.1007/978-3-030-39881-1_13OpenAlexW3002134333MaRDI QIDQ782174

Tatsuaki Ibusuki, Chuzo Iwamoto

Publication date: 22 July 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-39881-1_13

zbMATH Keywords

NP-hardorthogonal polygons\(r\)-visibilitychromatic art gallery problem

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (2)

Vertex-to-point conflict-free chromatic guarding is NP-hard ⋮ The dispersive art gallery problem

This page was built for publication: Computational complexity of the chromatic art gallery problem for orthogonal polygons