Improved bounds for the conflict-free chromatic art gallery problem

DOI10.1145/2582112.2582117zbMath1395.68286OpenAlexW2003554749MaRDI QIDQ4635537

Matúš Mihalák, Thomas Tschager, Subir Kumar Ghosh, Andreas Bärtschi, Peter Widmayer

Publication date: 23 April 2018

Published in: Proceedings of the thirtieth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2582112.2582117

zbMATH Keywords

polygonvisibilityart gallery problemconflict-free coloring

Mathematics Subject Classification ID

Hypergraphs (05C65) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Tight bounds for conflict-free chromatic guarding of orthogonal art galleries ⋮ On Conflict-Free Multi-coloring ⋮ Conflict-Free Coloring of Intersection Graphs ⋮ Coloring polygon visibility graphs and their generalizations ⋮ The dispersive art gallery problem ⋮ On colourability of polygon visibility graphs ⋮ On Colourability of Polygon Visibility Graphs ⋮ Unnamed Item

This page was built for publication: Improved bounds for the conflict-free chromatic art gallery problem