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.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.