@inproceedings{19fc7ae311ee4bef97ed3ee118c61c8f,

title = "A (7/2)-approximation algorithm for guarding orthogonal art galleries with sliding cameras",

abstract = "Consider a sliding camera that travels back and forth along an orthogonal line segment s inside an orthogonal polygon P with n vertices. The camera can see a point p inside P if and only if there exists a line segment containing p that crosses s at a right angle and is completely contained in P. In the minimum sliding cameras (MSC) problem, the objective is to guard P with the minimum number of sliding cameras. In this paper, we give an O(n 5/2)-time (7/2)-approximation algorithm to the MSC problem on any simple orthogonal polygon with n vertices, answering a question posed by Katz and Morgenstern (2011). To the best of our knowledge, this is the first constant-factor approximation algorithm for this problem.",

author = "Stephane Durocher and Omrit Filtser and Robert Fraser and Mehrabi, {Ali D.} and Saeed Mehrabi",

year = "2014",

month = jan,

day = "1",

doi = "10.1007/978-3-642-54423-1_26",

language = "English",

isbn = "9783642544224",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "294--305",

booktitle = "LATIN 2014",

address = "Germany",

note = "11th Latin American Theoretical Informatics Symposium, LATIN 2014 ; Conference date: 31-03-2014 Through 04-04-2014",

}