1. Alpert, H., Koch, C., Laison, J.D.: Obstacle numbers of graphs. Discrete Comput. Geom. 44(1), 223–244 (2009).
http://dx.doi.org/10.1007/s00454-009-9233-8
2. Lecture Notes in Computer Science;M Balko,2015
3. Berman, L.W., Chappell, G.G., Faudree, J.R., Gimbel, J., Hartman, C., Williams, G.I.: Graphs with obstacle number greater than one. Arxiv report
arXiv.org/abs/1606.03782
(2016)
4. Cardinal, J., Hoffmann, U.: Recognition and complexity of point visibility graphs. In: Arge, L., Pach, J. (eds.) Proceedings of the 31st International Symposium Computational Geometry (SoCG 2015), LIPIcs, vol. 34, pp. 171–185. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
5. Chaplick, S., Lipp, F., Park, J.w., Wolff, A.: Obstructing visibilities with one obstacle. Arxiv report
arXiv.org/abs/1607.00278v2
(2016)