GUARDING RECTANGULAR PARTITIONS

DOI10.1142/S0218195909003131MaRDI QIDQ3405972zbMATH OpenFDO

Authors Roi Krakovski, Matthew J. Katz, Yefim Dinitz

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)

Recommendations

• Guarding a line segment
• Guarding a line segment
• scientific article; zbMATH DE number 4060719
• Guarding in a simple polygon
• On Guarding Rectilinear Domains
• Generalized guarding and partitioning for rectilinear polygons
• Polygon guarding with orientation
• Guarding a set of line segments in the plane
• GUARDING A POLYGON FROM TWO NEARLY-OPPOSITE DIRECTIONS
• Rectangular partitions of a rectilinear polygon

Cites work

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

Cited in

(11)

• Box-respecting colorings of \(n\)-dimensional guillotine-partitions
• On Guarding Rectilinear Domains
• Polychromatic colorings of arbitrary rectangular partitions
• Polychromatic colorings of plane graphs
• Polychromatic 4-coloring of guillotine subdivisions
• Polychromatic colorings of rectangular partitions
• Facially-constrained colorings of plane graphs: a survey
• On guarding the vertices of rectilinear domains
• Polychromatic colorings of bounded degree plane graphs
• Guarding thin orthogonal polygons is hard
• Prisoners and guards on rectangular boards

This page was built for publication: GUARDING RECTANGULAR PARTITIONS

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