Maximizing the Guarded Interior of an Art Gallery
暂无分享,去创建一个
[1] Svante Carlsson,et al. Guarding a Treasury , 1993, CCCG.
[2] T. Shermer. Recent Results in Art Galleries , 1992 .
[3] Stephan Eidenbenz,et al. Inapproximability Results for Guarding Polygons without Holes , 1998, ISAAC.
[4] D. T. Lee,et al. Computational complexity of art gallery problems , 1986, IEEE Trans. Inf. Theory.
[5] Euripides Markou,et al. Maximizing the guarded boundary of an Art Gallery is APX-complete , 2003, Comput. Geom..
[6] Aldo Laurentini,et al. Guarding the walls of an art gallery , 1999, The Visual Computer.
[7] Stephan Johannes Eidenbenz. (In-)Approximability of visibility problems on polygons and terrains , 2000 .
[8] J. O'Rourke. Art gallery theorems and algorithms , 1987 .
[9] Euripides Markou,et al. How to Place Efficiently Guards and Paintings in an Art Gallery , 2005, Panhellenic Conference on Informatics.
[10] Jorge Urrutia,et al. Art Gallery and Illumination Problems , 2000, Handbook of Computational Geometry.
[11] E. M ARKOU. Approximating Visibility Problems within a Constant , 2006 .