Guarding rectangular art galleries
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- A Theorem on Planar Graphs
- 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
Cited in
(15)- Matching points with squares
- Guards, Galleries, Fortresses, and the Octoplex
- Algorithms and Computation
- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
- Polychromatic 4-coloring of guillotine subdivisions
- Illuminating labyrinths.
- Protecting convex sets
- Illuminating high-dimensional convex sets
- Illumination in the presence of opaque line segments in the plane
- Orthogonal art galleries with interior walls
- Covering and packing of rectilinear subdivision
- GUARDING RECTANGULAR PARTITIONS
- Guarding galleries and terrains
- Coverage with \(k\)-transmitters in the presence of obstacles
- Mobile versus point guards
This page was built for publication: Guarding rectangular art galleries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1326753)