Finding all weakly-visible chords of a polygon in linear time Conference

Das, G, Heffernan, PJ, Narasimhan, G. (1994). Finding all weakly-visible chords of a polygon in linear time . Lecture Notes in Computer Science, 824 LNCS 119-130. 10.1007/3-540-58218-5_11

cited authors

  • Das, G; Heffernan, PJ; Narasimhan, G

abstract

  • A chord of a simple polygon P is weakly-visible if every point on P is visible from some point on the chord. We give an optimal linear-time algorithm which computes all weakly-visible chords of a simple polygon P with n vertices.

publication date

  • January 1, 1994

published in

Digital Object Identifier (DOI)

start page

  • 119

end page

  • 130

volume

  • 824 LNCS