Guarding rectangular art galleries

DOI10.1016/0166-218X(92)00029-LzbMath0793.68165OpenAlexW2045706387MaRDI QIDQ1326753

Eduardo Rivera-Campo, Joseph Zaks, Jorge Urrutia, Nicola Santoro, Jurek Czyzowicz

Publication date: 21 August 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(92)00029-l

zbMATH Keywords

computational geometryguardingwatchman problemrectangular art gallery

Mathematics Subject Classification ID

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

Related Items (10)

Protecting convex sets ⋮ Illuminating high-dimensional convex sets ⋮ Coverage with \(k\)-transmitters in the presence of obstacles ⋮ Illuminating labyrinths. ⋮ Orthogonal art galleries with interior walls ⋮ Polychromatic 4-coloring of guillotine subdivisions ⋮ Illumination in the presence of opaque line segments in the plane ⋮ Matching points with squares ⋮ Covering and packing of rectilinear subdivision ⋮ GUARDING RECTANGULAR PARTITIONS

Cites Work

• Lower bounds on the cardinality of the maximum matchings of planar graphs
• The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
• A Theorem on Planar Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Guarding rectangular art galleries