Bibliographic Search

Ghosh S.K. et Mount D.M. -- An output-sensitive algorithm for computing visibility graphs. SIAM J. Comput., vol.20, 1991, pp. 888--910.

Guibas L.J., Hershberger J., Leven D., Sharir M. et Tarjan R.E. -- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica, vol.2, 1987, pp. 209--233.

Overmars M.H. et Welzl E. -- New methods for computing visibility graphs. In: Proc. 4th Annu. ACM Sympos. Comput. Geom., pp. 164--171.

Chazelle B. et Guibas L.J. -- Visibility and intersection problems in plane geometry. Discrete Comput. Geom., vol.4, 1989, pp. 551--581.

previous next