P. J. Heffernan

G. Das, P. J. Heffernan, and G. Narasimhan. Finding all weakly-visible chords of a polygon in linear time. Nordic Journal of Computing, 1(4):433-457, Winter 1994. Abstract, References, etc.