Conflict-free chromatic art gallery coverage

DOI10.1007/s00453-012-9732-5zbMath1286.68460OpenAlexW2161263108MaRDI QIDQ2441589

Subhash Suri, Andreas Bärtschi

Publication date: 25 March 2014

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2012/3395/

zbMATH Keywords

visibilityart gallery problemconflict-free coloringpolygon partitioning

Mathematics Subject Classification ID

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

Related Items (7)

Tight bounds for conflict-free chromatic guarding of orthogonal art galleries ⋮ On Conflict-Free Multi-coloring ⋮ Vertex-to-point conflict-free chromatic guarding is NP-hard ⋮ Conflict-Free Coloring of Intersection Graphs ⋮ The dispersive art gallery problem ⋮ Finding minimum witness sets in orthogonal polygons ⋮ Erratum to: ``Conflict-free chromatic art gallery coverage

Cites Work

• Unnamed Item
• Coloring axis-parallel rectangles
• A combinatorial theorem in plane geometry
• Modem illumination of monotone polygons
• On The Chromatic Number of Geometric Hypergraphs
• Conflict-Free Coloring and its Applications

This page was built for publication: Conflict-free chromatic art gallery coverage