Guarding Polygons with Sliding k-modem Cameras

Please enable javascript in your browser.

Beiruti, Mohammad Amin | 2015

377 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 47840 (19)
University: Sharif University of Technology
Department: Computer Engineering
Advisor(s): Ghodsi, Mohammad
Abstract:
In this thesis, we study the problem of guarding art galleries with sliding cameras and k-transmitter. This problem is a new version of classic art gallery problem, which the goal is covering the entire region with minimum number of guards. In early version of art gallery problem, usually point guards with 360 degree vision were used, but in this thesis we use sliding cameras instead. This new guards specified by an orthogonal segment which entirely settled interior of polygon and can see up to k walls. Based on this two notions (sliding camera and k-transmitter) we say that a guard can see point p, if the intersections number of normal segment through p to corresponding segment of guard didn’t exceed k. In this thesis, we consider the minimum cardinality sliding camera problem and propose a 6-approximation
algorithm for it
Keywords:
Computational Geometry ; Guarding Polygons ; Sliding Cameras ; Guarding Art Gallery ; Orthogonal Polygon ; K-Transmitter Model