On Some City Guarding Problems
From MaRDI portal
Publication:3511372
DOI10.1007/978-3-540-69733-6_59zbMath1148.68547MaRDI QIDQ3511372
Ovidiu Daescu, Sergey Bereg, Simeon C. Ntafos, Lichen Bao, Junqiang Zhou
Publication date: 10 July 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_59
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An alternative proof of the rectilinear art gallery theorem
- Orthogonal art galleries with holes: a coloring proof of Aggarwal's theorem
- Galleries need fewer mobile guards: A variation on Chvatal's theorem
- On gallery watchmen in grids
- A combinatorial theorem in plane geometry
- Traditional Galleries Require Fewer Watchmen
- Computational complexity of art gallery problems
- An art gallery theorem for line segments in the plane
- A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems