On conflict-free chromatic guarding of simple polygons

DOI10.1007/978-3-030-36412-0_49zbMath1435.68339arXiv1904.08624OpenAlexW2992329195MaRDI QIDQ2180187

Subir Kumar Ghosh, Onur Çağırıcı, Petr Hliněný, Bodhayan Roy

Publication date: 13 May 2020

Full work available at URL: https://arxiv.org/abs/1904.08624

zbMATH Keywords

computational geometryvisibility graphart gallery problempolygon guardingconflict-free coloring

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Vertex-to-point conflict-free chromatic guarding is NP-hard ⋮ Coloring polygon visibility graphs and their generalizations

This page was built for publication: On conflict-free chromatic guarding of simple polygons