Guarding monotone art galleries with sliding cameras in linear time

@article{Berg2017GuardingMA,
  title={Guarding monotone art galleries with sliding cameras in linear time},
  author={Mark de Berg and Stephane Durocher and Saeed Mehrabi},
  journal={J. Discrete Algorithms},
  year={2017},
  volume={44},
  pages={39-47}
}
A sliding camera in an orthogonal polygon P—that is, a polygon all of whose edges are axis-parallel—is a point guard g that travels back and forth along an axis-parallel line segment s inside P . A point p in P is guarded by g if and only if there exists a point q on s such that line segment pq is normal to s and contained in P . In the minimum sliding cameras (MSC) problem, the objective is to guard P with the minimum number of sliding cameras. We give a dynamic programming algorithm that… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 26 references

Guarding monotone art galleries with sliding cameras in linear time, in: Proceedings of 8th International Con- 430 ference on Combinatorial Optimization and Applications (COCOA

  • M. de Berg, S. Durocher, S. Mehrabi
  • 2014
Highly Influential
4 Excerpts

Geometric optimization problems on orthogonal polygons: 480 hardness results and approximation algorithms

  • S. Mehrabi
  • Ph.D. thesis, University of Manitoba, Winnipeg…
  • 2015
1 Excerpt

Guarding polygons with sliding cameras

  • S. Seddighin
  • Master’s thesis, Sharif University of Technology
  • 2014
1 Excerpt

Similar Papers

Loading similar papers…