GUARDING RECTANGULAR PARTITIONS

DOI10.1142/S0218195909003131zbMath1186.65022MaRDI QIDQ3405972

Roi Krakovski, Matthew J. Katz

Publication date: 12 February 2010

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

NP-hardnessrectangular partitionsvertex guardsedge guardsface-respecting coloringminimum-cardinality guarding set

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (6)

Facially-constrained colorings of plane graphs: a survey ⋮ Polychromatic colorings of plane graphs ⋮ Box-respecting colorings of \(n\)-dimensional guillotine-partitions ⋮ Polychromatic 4-coloring of guillotine subdivisions ⋮ Polychromatic colorings of bounded degree plane graphs ⋮ Polychromatic colorings of arbitrary rectangular partitions

Cites Work

• Guarding rectangular art galleries
• Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces

This page was built for publication: GUARDING RECTANGULAR PARTITIONS