Metaheurísticas para resolver problemas de visibilidad

[1]  Simeon Ntafos,et al.  Watchman routes under limited visibility , 1992 .

[2]  C. Ribeiro,et al.  Essays and Surveys in Metaheuristics , 2002, Operations Research/Computer Science Interfaces Series.

[3]  Dr. Zbigniew Michalewicz,et al.  How to Solve It: Modern Heuristics , 2004 .

[4]  D. T. Lee,et al.  Computational complexity of art gallery problems , 1986, IEEE Trans. Inf. Theory.

[5]  V. Chvátal.  A combinatorial theorem in plane geometry , 1975 .

[6]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[7]  António Leslie Bajuelos,et al.  Estimating the Maximum Hidden Vertex Set in Polygons , 2008, 2008 International Conference on Computational Sciences and Its Applications.

[8]  Robert A. Melter,et al.  Vision Geometry , 1992 .

[9]  Joseph O'Rourke,et al.  Some NP-hard polygon decomposition problems , 1983, IEEE Trans. Inf. Theory.

[10]  J. O'Rourke.  Art gallery theorems and algorithms , 1987 .

[11]  Jorge Urrutia,et al.  Art Gallery and Illumination Problems , 2000, Handbook of Computational Geometry.

[12]  Subir Kumar Ghosh,et al.  Visibility Algorithms in the Plane , 2007 .

[13]  Simeon C. Ntafos,et al.  The zookeeper route problem , 1992, Inf. Sci..