Finding all Weakly-Visible Chords of a Polygon in Linear Time

Gautam Das, Paul J. Heffernan, Giri Narasimhan. Finding all Weakly-Visible Chords of a Polygon in Linear Time. Nord. J. Comput., 1(4):433-457, 1994.

@article{DasHN94:0,
  title = {Finding all Weakly-Visible Chords of a Polygon in Linear Time},
  author = {Gautam Das and Paul J. Heffernan and Giri Narasimhan},
  year = {1994},
  researchr = {https://researchr.org/publication/DasHN94%3A0},
  cites = {0},
  citedby = {0},
  journal = {Nord. J. Comput.},
  volume = {1},
  number = {4},
  pages = {433-457},
}