Improved bounds for the conflict-free chromatic art gallery problem

DOI10.1145/2582112.2582117MaRDI QIDQ4635537zbMATH OpenOpenAlexFDO

Authors Andreas Bärtschi, Subir Kumar Ghosh, Matúš Mihalák, Thomas Tschager, 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

visibilitypolygonconflict-free coloringart gallery problem

Mathematics Subject Classification ID

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

Recommendations

• Conflict-free chromatic art gallery coverage
• Tight bounds for conflict-free chromatic guarding of orthogonal art galleries
• Tight bounds for conflict-free chromatic guarding of orthogonal art galleries
• Conflict-free chromatic art gallery coverage
• On conflict-free chromatic guarding of simple polygons

Cited in

(13)

• On colourability of polygon visibility graphs
• Erratum to: ``Conflict-free chromatic art gallery coverage
• Conflict-free chromatic art gallery coverage
• Tight bounds for conflict-free chromatic guarding of orthogonal art galleries
• Tight bounds for conflict-free chromatic guarding of orthogonal art galleries
• Conflict-free chromatic art gallery coverage
• On colourability of polygon visibility graphs
• On conflict-free chromatic guarding of simple polygons
• The dispersive art gallery problem
• On conflict-free multi-coloring
• Conflict-free coloring of intersection graphs
• Conflict-free coloring of intersection graphs
• Coloring polygon visibility graphs and their generalizations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635537)