Sliding k-Transmitters: Hardness and Approximation
暂无分享,去创建一个
[1] Timothy M. Chan,et al. On Guarding Orthogonal Polygons with Sliding Cameras , 2016, WALCOM.
[2] Roberto Tamassia,et al. A unified approach to visibility representations of planar graphs , 1986, Discret. Comput. Geom..
[3] Jorge Urrutia,et al. Modem illumination of monotone polygons , 2015, Comput. Geom..
[4] Abbas Mehrabi,et al. A Note on Approximating 2-Transmitters , 2015, ArXiv.
[5] Bengt J. Nilsson. Approximate Guarding of Monotone and Rectilinear Polygons , 2005, ICALP.
[6] Mohammad Ghodsi,et al. Covering Orthogonal Polygons with Sliding k-Transmitters , 2014, CCCG.
[7] J. O'Rourke. Art gallery theorems and algorithms , 1987 .
[8] Stephane Durocher,et al. Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results , 2013, MFCS.
[9] Prosenjit Bose,et al. Coverage with k-transmitters in the presence of obstacles , 2010, Journal of Combinatorial Optimization.
[10] Mark de Berg,et al. Guarding monotone art galleries with sliding cameras in linear time , 2014, J. Discrete Algorithms.
[11] Goos Kant,et al. On Triangulating Planar Graphs under the Four-Connectivity Constraint , 1994, Algorithmica.
[12] Christiane Schmidt,et al. Combinatorics and complexity of guarding polygons with edge and point 2-transmitters , 2015, Comput. Geom..
[13] Stephane Durocher,et al. Guarding orthogonal art galleries with sliding cameras , 2017, Comput. Geom..