Efficient Computation of Visibility Polygons
  Determining visibility in planar polygons and arrangements is an important subroutine for many algorithms in computational geometry. In this paper, we report on new implementations, and corresponding experimental evaluations, for two established and one novel algorithm for computing visibility polygons. These algorithms will be released to the public shortly, as a new package for the Computational Geometry Algorithms Library (CGAL). 
Francisc Bungiu and Michael Hemmer and John Hershberger and Kan Huang   and Alexander Kr\"oller
cs.CG