Abstract
We study the problem of guarding an orthogonal art gallery with security cameras sliding back and forth along straight tracks. We show that if only vertical (alternatively, horizontal) tracks are allowed, then a solution minimizing the number of tracks can be found in polynomial time, and if both orientations are allowed, then a 2-approximation can be found in polynomial time for x-monotone galleries.
| Original language | American English |
|---|---|
| Pages (from-to) | 241-250 |
| Number of pages | 10 |
| Journal | International Journal of Computational Geometry and Applications |
| Volume | 21 |
| Issue number | 2 |
| DOIs | |
| State | Published - 1 Apr 2011 |
Keywords
- Art-gallery
- link distance
- mobile guards
- orthogonal polygons
- perfect graphs
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Geometry and Topology
- Computational Theory and Mathematics
- Computational Mathematics
- Applied Mathematics
Fingerprint
Dive into the research topics of 'Guarding orthogonal art galleries with sliding cameras'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver