1. Lecture Notes in Computer Science;B.K. Bhattacharya,2001
2. Chazelle, B., Guibas, L.: Visibility and intersection problem in plane geometry. Discrete Comput. Geom. 4, 551–581 (1989)
3. Efrat, A., Guibas, L.J., Har-Peled, S., Lin, D.C., Mitchell, J.S.B., Murali, T.M.: Sweeping simple polygons with a chain of guards. In: Proc., ACM-SIAM Sympos. Discrete Algorithms, pp. 927–936 (2000)
4. Guibas, L.J., Latombe, J.C., Lavalle, S.M., Lin, D., Motwani, R.: Visibility-based pursuit-evasion in a polygonal environment. IJCGA 9, 471–493 (1999)
5. Heffernan, P.J.: An optimal algorithm for the two-guard problem. IJCGA 6, 15–44 (1996)